feat: add typescript solution to lc problem: No.1647.Minimum Deletions to Make Character Frequencies Unique (doocs#492)

zhaocchen · web-flow · commit bdb56227fe1f · 2021-07-01T23:27:46.000+08:00
diff --git a/solution/1600-1699/1647.Minimum Deletions to Make Character Frequencies Unique/README.md b/solution/1600-1699/1647.Minimum Deletions to Make Character Frequencies Unique/README.md
@@ -53,6 +53,8 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+哈希表 + 升序排序
+
 <!-- tabs:start -->
 
 ### **Python3**
@@ -71,6 +73,27 @@
 
 ```
 
+### **TypeScript**
+
+```ts
+function minDeletions(s: string): number {
+    let map = {};
+    for (let c of s) {
+        map[c] = (map[c] || 0) + 1;
+    }
+    let ans = 0;
+    let vals: number[] = Object.values(map);
+    vals.sort((a, b) => a - b);
+    for (let i = 1; i < vals.length; ++i) {
+        while(vals[i] > 0 && i != vals.indexOf(vals[i])) {
+            --vals[i];
+            ++ans;
+        }
+    }
+    return ans;
+};
+```
+
 ### **...**
 
 ```
diff --git a/solution/1600-1699/1647.Minimum Deletions to Make Character Frequencies Unique/README_EN.md b/solution/1600-1699/1647.Minimum Deletions to Make Character Frequencies Unique/README_EN.md
@@ -61,6 +61,27 @@ Note that we only care about characters that are still in the string at the end
 
 ```
 
+### **TypeScript**
+
+```ts
+function minDeletions(s: string): number {
+    let map = {};
+    for (let c of s) {
+        map[c] = (map[c] || 0) + 1;
+    }
+    let ans = 0;
+    let vals: number[] = Object.values(map);
+    vals.sort((a, b) => a - b);
+    for (let i = 1; i < vals.length; ++i) {
+        while(vals[i] > 0 && i != vals.indexOf(vals[i])) {
+            --vals[i];
+            ++ans;
+        }
+    }
+    return ans;
+};
+```
+
 ### **...**
 
 ```
diff --git a/solution/1600-1699/1647.Minimum Deletions to Make Character Frequencies Unique/Solution.ts b/solution/1600-1699/1647.Minimum Deletions to Make Character Frequencies Unique/Solution.ts
@@ -0,0 +1,16 @@
+function minDeletions(s: string): number {
+    let map = {};
+    for (let c of s) {
+        map[c] = (map[c] || 0) + 1;
+    }
+    let ans = 0;
+    let vals: number[] = Object.values(map);
+    vals.sort((a, b) => a - b);
+    for (let i = 1; i < vals.length; ++i) {
+        while(vals[i] > 0 && i != vals.indexOf(vals[i])) {
+            --vals[i];
+            ++ans;
+        }
+    }
+    return ans;
+};
