feat: add solutions to lc problem: No.4545 (#4401)

No.3545.Minimum Deletions for At Most K Distinct Characters

Author: yanglbme

solution/3500-3599/3545.Minimum Deletions for At Most K Distinct Characters/README.md

@@ -87,32 +87,88 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3545.Mi
 
 <!-- solution:start -->
 
-### 方法一
+### 方法一：计数 + 贪心
+
+我们可以使用一个数组 $\textit{cnt}$ 来统计每个字符的出现频率。然后我们对这个数组进行排序，最后返回前 $26 - k$ 个元素的和。
+
+时间复杂度 $O(|\Sigma| \times \log |\Sigma|)$，空间复杂度 $O(|\Sigma|)$，其中 $|\Sigma|$ 是字符集的大小，本题中 $|\Sigma| = 26$。
 
 <!-- tabs:start -->
 
 #### Python3
 
 ```python
-
+class Solution:
+    def minDeletion(self, s: str, k: int) -> int:
+        return sum(sorted(Counter(s).values())[:-k])
 ```
 
 #### Java
 
 ```java
-
+class Solution {
+    public int minDeletion(String s, int k) {
+        int[] cnt = new int[26];
+        for (char c : s.toCharArray()) {
+            ++cnt[c - 'a'];
+        }
+        Arrays.sort(cnt);
+        int ans = 0;
+        for (int i = 0; i + k < 26; ++i) {
+            ans += cnt[i];
+        }
+        return ans;
+    }
+}
 ```
 
 #### C++
 
 ```cpp
-
+class Solution {
+public:
+    int minDeletion(string s, int k) {
+        vector<int> cnt(26);
+        for (char c : s) {
+            ++cnt[c - 'a'];
+        }
+        ranges::sort(cnt);
+        int ans = 0;
+        for (int i = 0; i + k < 26; ++i) {
+            ans += cnt[i];
+        }
+        return ans;
+    }
+};
 ```
 
 #### Go
 
 ```go
+func minDeletion(s string, k int) (ans int) {
+	cnt := make([]int, 26)
+	for _, c := range s {
+		cnt[c-'a']++
+	}
+	sort.Ints(cnt)
+	for i := 0; i+k < len(cnt); i++ {
+		ans += cnt[i]
+	}
+	return
+}
+```
 
+#### TypeScript
+
+```ts
+function minDeletion(s: string, k: number): number {
+    const cnt: number[] = Array(26).fill(0);
+    for (const c of s) {
+        ++cnt[c.charCodeAt(0) - 97];
+    }
+    cnt.sort((a, b) => a - b);
+    return cnt.slice(0, 26 - k).reduce((a, b) => a + b, 0);
+}
 ```
 
 <!-- tabs:end -->

solution/3500-3599/3545.Minimum Deletions for At Most K Distinct Characters/README_EN.md

@@ -85,32 +85,88 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3545.Mi
 
 <!-- solution:start -->
 
-### Solution 1
+### Solution 1: Counting + Greedy
+
+We can use an array $\textit{cnt}$ to count the frequency of each character. Then, we sort this array and return the sum of the first $26 - k$ elements.
+
+The time complexity is $O(|\Sigma| \times \log |\Sigma|)$, and the space complexity is $O(|\Sigma|)$, where $|\Sigma|$ is the size of the character set. In this problem, $|\Sigma| = 26$.
 
 <!-- tabs:start -->
 
 #### Python3
 
 ```python
-
+class Solution:
+    def minDeletion(self, s: str, k: int) -> int:
+        return sum(sorted(Counter(s).values())[:-k])
 ```
 
 #### Java
 
 ```java
-
+class Solution {
+    public int minDeletion(String s, int k) {
+        int[] cnt = new int[26];
+        for (char c : s.toCharArray()) {
+            ++cnt[c - 'a'];
+        }
+        Arrays.sort(cnt);
+        int ans = 0;
+        for (int i = 0; i + k < 26; ++i) {
+            ans += cnt[i];
+        }
+        return ans;
+    }
+}
 ```
 
 #### C++
 
 ```cpp
-
+class Solution {
+public:
+    int minDeletion(string s, int k) {
+        vector<int> cnt(26);
+        for (char c : s) {
+            ++cnt[c - 'a'];
+        }
+        ranges::sort(cnt);
+        int ans = 0;
+        for (int i = 0; i + k < 26; ++i) {
+            ans += cnt[i];
+        }
+        return ans;
+    }
+};
 ```
 
 #### Go
 
 ```go
+func minDeletion(s string, k int) (ans int) {
+	cnt := make([]int, 26)
+	for _, c := range s {
+		cnt[c-'a']++
+	}
+	sort.Ints(cnt)
+	for i := 0; i+k < len(cnt); i++ {
+		ans += cnt[i]
+	}
+	return
+}
+```
 
+#### TypeScript
+
+```ts
+function minDeletion(s: string, k: number): number {
+    const cnt: number[] = Array(26).fill(0);
+    for (const c of s) {
+        ++cnt[c.charCodeAt(0) - 97];
+    }
+    cnt.sort((a, b) => a - b);
+    return cnt.slice(0, 26 - k).reduce((a, b) => a + b, 0);
+}
 ```
 
 <!-- tabs:end -->

solution/3500-3599/3545.Minimum Deletions for At Most K Distinct Characters/Solution.cpp

@@ -0,0 +1,15 @@
+class Solution {
+public:
+    int minDeletion(string s, int k) {
+        vector<int> cnt(26);
+        for (char c : s) {
+            ++cnt[c - 'a'];
+        }
+        ranges::sort(cnt);
+        int ans = 0;
+        for (int i = 0; i + k < 26; ++i) {
+            ans += cnt[i];
+        }
+        return ans;
+    }
+};

solution/3500-3599/3545.Minimum Deletions for At Most K Distinct Characters/Solution.go

@@ -0,0 +1,11 @@
+func minDeletion(s string, k int) (ans int) {
+	cnt := make([]int, 26)
+	for _, c := range s {
+		cnt[c-'a']++
+	}
+	sort.Ints(cnt)
+	for i := 0; i+k < len(cnt); i++ {
+		ans += cnt[i]
+	}
+	return
+}

solution/3500-3599/3545.Minimum Deletions for At Most K Distinct Characters/Solution.java

@@ -0,0 +1,14 @@
+class Solution {
+    public int minDeletion(String s, int k) {
+        int[] cnt = new int[26];
+        for (char c : s.toCharArray()) {
+            ++cnt[c - 'a'];
+        }
+        Arrays.sort(cnt);
+        int ans = 0;
+        for (int i = 0; i + k < 26; ++i) {
+            ans += cnt[i];
+        }
+        return ans;
+    }
+}

solution/3500-3599/3545.Minimum Deletions for At Most K Distinct Characters/Solution.py

@@ -0,0 +1,3 @@
+class Solution:
+    def minDeletion(self, s: str, k: int) -> int:
+        return sum(sorted(Counter(s).values())[:-k])

solution/3500-3599/3545.Minimum Deletions for At Most K Distinct Characters/Solution.ts

@@ -0,0 +1,8 @@
+function minDeletion(s: string, k: number): number {
+    const cnt: number[] = Array(26).fill(0);
+    for (const c of s) {
+        ++cnt[c.charCodeAt(0) - 97];
+    }
+    cnt.sort((a, b) => a - b);
+    return cnt.slice(0, 26 - k).reduce((a, b) => a + b, 0);
+}