| | | 1 | | // -------------------------------------------------------------------------------- |
| | | 2 | | // Copyright (C) 2025 Eugene Eremeev (also known as Yevhenii Yeriemeieiv). |
| | | 3 | | // All Rights Reserved. |
| | | 4 | | // -------------------------------------------------------------------------------- |
| | | 5 | | // This software is the confidential and proprietary information of Eugene Eremeev |
| | | 6 | | // (also known as Yevhenii Yeriemeieiv) ("Confidential Information"). You shall not |
| | | 7 | | // disclose such Confidential Information and shall use it only in accordance with |
| | | 8 | | // the terms of the license agreement you entered into with Eugene Eremeev (also |
| | | 9 | | // known as Yevhenii Yeriemeieiv). |
| | | 10 | | // -------------------------------------------------------------------------------- |
| | | 11 | | |
| | | 12 | | namespace LeetCode.Algorithms.HandOfStraights; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class HandOfStraightsSortedDictionary : IHandOfStraights |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n log n) |
| | | 19 | | /// Space complexity - O(n) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="hand"></param> |
| | | 22 | | /// <param name="groupSize"></param> |
| | | 23 | | /// <returns></returns> |
| | | 24 | | public bool IsNStraightHand(int[] hand, int groupSize) |
| | 15 | 25 | | { |
| | 15 | 26 | | if (hand.Length % groupSize != 0) |
| | 3 | 27 | | { |
| | 3 | 28 | | return false; |
| | | 29 | | } |
| | | 30 | | |
| | 12 | 31 | | var cardsDictionary = new SortedDictionary<int, int>(); |
| | | 32 | | |
| | 168 | 33 | | foreach (var card in hand) |
| | 66 | 34 | | { |
| | 66 | 35 | | if (!cardsDictionary.TryAdd(card, 1)) |
| | 10 | 36 | | { |
| | 10 | 37 | | cardsDictionary[card]++; |
| | 10 | 38 | | } |
| | 66 | 39 | | } |
| | | 40 | | |
| | 33 | 41 | | while (cardsDictionary.Count > 0) |
| | 23 | 42 | | { |
| | 23 | 43 | | var firstCard = cardsDictionary.First().Key; |
| | | 44 | | |
| | 168 | 45 | | for (var i = 0; i < groupSize; i++) |
| | 63 | 46 | | { |
| | 63 | 47 | | var currentCard = firstCard + i; |
| | | 48 | | |
| | 63 | 49 | | if (cardsDictionary.TryGetValue(currentCard, out var value)) |
| | 61 | 50 | | { |
| | 61 | 51 | | if (value == 1) |
| | 53 | 52 | | { |
| | 53 | 53 | | cardsDictionary.Remove(currentCard); |
| | 53 | 54 | | } |
| | | 55 | | else |
| | 8 | 56 | | { |
| | 8 | 57 | | cardsDictionary[currentCard] = value - 1; |
| | 8 | 58 | | } |
| | 61 | 59 | | } |
| | | 60 | | else |
| | 2 | 61 | | { |
| | 2 | 62 | | return false; |
| | | 63 | | } |
| | 61 | 64 | | } |
| | 21 | 65 | | } |
| | | 66 | | |
| | 10 | 67 | | return true; |
| | 15 | 68 | | } |
| | | 69 | | } |