测试

Author: masx200

partition-to-k-equal-sum-subsets/index.ts

@@ -7,11 +7,9 @@ export default function canPartitionKSubsets(
     const sub = Math.floor(sum / k);
     nums.sort((a, b) => a - b);
     if (nums[nums.length - 1] > sub) return false;
-    for (
-        let i = nums.length - 1;
-        i >= 0 && nums[i] === sub;
-        i--, k--, nums.pop()
-    ) { // deno-lint-ignore no-empty
+    let i = nums.length - 1;
+    while (i >= 0 && nums[i] === sub) {
+        i--, k--, nums.pop();
     }
 
     const n = nums.length;

partition-to-k-equal-sum-subsets/test.ts

@@ -0,0 +1,16 @@
+import { assertEquals } from "asserts";
+import canPartitionKSubsets from "./index.ts";
+Deno.test("partition-to-k-equal-sum-subsets", () => {
+    const nums = [4, 3, 2, 3, 5, 2, 1],
+        k = 4,
+        输出 = true;
+
+    assertEquals(canPartitionKSubsets(nums, k), 输出);
+});
+Deno.test("partition-to-k-equal-sum-subsets", () => {
+    const nums = [1, 2, 3, 4],
+        k = 3,
+        输出 = false;
+
+    assertEquals(canPartitionKSubsets(nums, k), 输出);
+});