https://leetcode.cn/problems/divide-array-in-sets-of-k-consecutive-numbers https://leetcode.cn/problems/hand-of-straights

Author: masx200

README.md

@@ -45,6 +45,10 @@ Step 2. Add the dependency
 
 <summary>展开查看</summary>
 
+https://leetcode.cn/problems/divide-array-in-sets-of-k-consecutive-numbers
+
+https://leetcode.cn/problems/hand-of-straights
+
 https://leetcode.cn/problems/minimum-changes-to-make-alternating-binary-string
 
 https://leetcode.cn/problems/sum-of-all-odd-length-subarrays

divide-array-in-sets-of-k-consecutive-numbers/index.ts

@@ -0,0 +1,3 @@
+import isNStraightHand from "../hand-of-straights/index.ts";
+
+export default isNStraightHand;

hand-of-straights/index.ts

@@ -0,0 +1,28 @@
+function isNStraightHand(hand: number[], groupSize: number): boolean {
+    const n = hand.length;
+    if (n % groupSize !== 0) {
+        return false;
+    }
+    hand.sort((a, b) => a - b);
+    const cnt = new Map<number, number>();
+    for (const x of hand) {
+        cnt.set(x, (cnt.get(x) || 0) + 1);
+    }
+    for (const x of hand) {
+        if (!cnt.has(x)) {
+            continue;
+        }
+        for (let j = 0; j < groupSize; j++) {
+            const num = x + j;
+            if (!cnt.has(num)) {
+                return false;
+            }
+            cnt.set(num, (cnt.get(num) ?? 0) - 1);
+            if (cnt.get(num) == 0) {
+                cnt.delete(num);
+            }
+        }
+    }
+    return true;
+}
+export default isNStraightHand;

minimum-changes-to-make-alternating-binary-string/index.ts

@@ -1,10 +1,10 @@
-function minOperations(s: string): number {
-    const res = Array.prototype.reduce.call(
-        s,
-        //@ts-ignore
-        (p: number, c: string, i: number) => p + Number(i % 2 === Number(c)),
-        0
-    ) as number;
-    return Math.min(res, s.length - res);
-}
-export default minOperations;
+function minOperations(s: string): number {
+    const res = Array.prototype.reduce.call(
+        s,
+        //@ts-ignore
+        (p: number, c: string, i: number) => p + Number(i % 2 === Number(c)),
+        0,
+    ) as number;
+    return Math.min(res, s.length - res);
+}
+export default minOperations;