https://leetcode.cn/problems/remove-letter-to-equalize-frequency/

Author: masx200

README.md

@@ -10,6 +10,8 @@ leetcode 测试
 
 ##### 包含的内容如下
 
+https://leetcode.cn/problems/remove-letter-to-equalize-frequency/
+
 https://leetcode.cn/problems/longest-uploaded-prefix/
 
 https://leetcode.cn/problems/find-mode-in-binary-search-tree/

deps.ts

@@ -7,6 +7,7 @@ export {
     equal,
 } from "https://deno.land/[email protected]/testing/asserts.ts";
 export { default as random } from "https://cdn.skypack.dev/[email protected]/random?dts";
+export { default as countBy } from "https://cdn.skypack.dev/[email protected]/countBy?dts";
 export { default as zip } from "https://cdn.skypack.dev/[email protected]/zip?dts";
 export { default as isEqual } from "https://cdn.skypack.dev/[email protected]/isEqual?dts";
 export { default as uniqBy } from "https://cdn.skypack.dev/[email protected]/uniqBy?dts";

remove-letter-to-equalize-frequency/index.ts

@@ -0,0 +1,14 @@
+import { countBy } from "../deps.ts";
+
+function equalFrequency(word: string): boolean {
+    for (let i = 0; i < word.length; i++) {
+        const obj = countBy(word.slice(0, i) + word.slice(i + 1)),
+            set = new Set();
+        for (const k in obj) {
+            set.add(obj[k]);
+        }
+        if (set.size === 1) return true;
+    }
+    return false;
+}
+export default equalFrequency;

remove-letter-to-equalize-frequency/test.ts

@@ -0,0 +1,5 @@
+import { assertEquals } from "https://deno.land/[email protected]/testing/asserts.ts";
+import equalFrequency from "./index.ts";
+Deno.test("remove-letter-to-equalize-frequency", () => {
+    assertEquals(["abcc", "aazz"].map(equalFrequency), [true, false]);
+});