1217. Play with Chips (axross#120)

Author: Kohei Asai

Diff for: solutions/play_with_chips.ts

@@ -0,0 +1,11 @@
+// 1217. Play with Chips
+// https://leetcode.com/problems/play-with-chips/
+export default function minCostToMoveChips(chips: number[]): number {
+  return Math.min(
+    ...chips.reduce(
+      ([odd, even], chip) =>
+        chip % 2 === 1 ? [odd + 1, even] : [odd, even + 1],
+      [0, 0]
+    )
+  );
+}

Diff for: solutions/play_with_chips_test.ts

@@ -0,0 +1,9 @@
+import { test } from "https://deno.land/std/testing/mod.ts";
+import { assertStrictEq } from "https://deno.land/std/testing/asserts.ts";
+import minCostToMoveChips from "./play_with_chips.ts";
+
+test("1217. Play with Chips", () => {
+  assertStrictEq(minCostToMoveChips([1, 2, 3]), 1);
+  assertStrictEq(minCostToMoveChips([2, 2, 2, 3, 3]), 2);
+  assertStrictEq(minCostToMoveChips([1, 2, 3, 4, 5, 6, 7, 8, 9]), 4);
+});