feat: add solutions to lc problem: No.0443.String Compression

Author: yanglbme

lcof/面试题48. 最长不含重复字符的子字符串/README.md

@@ -35,6 +35,14 @@
 
 ## 解法
 
+“滑动窗口 + 哈希表”。
+
+定义一个哈希表记录当前窗口内出现的字符，i、j 分别表示不重复子串的结束位置和开始位置，res 表示无重复字符子串的最大长度。
+
+遍历 i，若 `[j, i - 1]` 窗口内存在 `s[i]`，则 j 循环向右移动，更新哈希表，直至 `[j, i - 1]` 窗口不存在 `s[i]`，循环结束。将 `s[i]` 加入哈希表中，此时 `[j, i]` 窗口内不含重复元素，更新 res 的最大值：`res = max(res, i - j + 1)`。
+
+最后返回 res 即可。
+
 <!-- tabs:start -->
 
 ### **Python3**

solution/0000-0099/0003.Longest Substring Without Repeating Characters/README.md

@@ -56,7 +56,7 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
-“双指针 + 滑动窗口”。
+“滑动窗口 + 哈希表”。
 
 定义一个哈希表记录当前窗口内出现的字符，i、j 分别表示不重复子串的结束位置和开始位置，res 表示无重复字符子串的最大长度。
 

solution/0400-0499/0443.String Compression/README.md

@@ -72,22 +72,108 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+双指针。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def compress(self, chars: List[str]) -> int:
+        i, k, n = 0, 0, len(chars)
+        while i < n:
+            j = i + 1
+            while j < n and chars[j] == chars[i]:
+                j += 1
+            chars[k] = chars[i]
+            k += 1
+            if j - i > 1:
+                cnt = str(j - i)
+                for c in cnt:
+                    chars[k] = c
+                    k += 1
+            i = j
+        return k
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int compress(char[] chars) {
+        int k = 0, n = chars.length;
+        for (int i = 0, j = i + 1; i < n;) {
+            while (j < n && chars[j] == chars[i]) {
+                ++j;
+            }
+            chars[k++] = chars[i];
+            if (j - i > 1) {
+                String cnt = String.valueOf(j - i);
+                for (char c : cnt.toCharArray()) {
+                    chars[k++] = c;
+                }
+            }
+            i = j;
+        }
+        return k;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int compress(vector<char> &chars) {
+        int k = 0, n = chars.size();
+        for (int i = 0, j = i + 1; i < n;)
+        {
+            while (j < n && chars[j] == chars[i])
+                ++j;
+            chars[k++] = chars[i];
+            if (j - i > 1)
+            {
+                for (char c : to_string(j - i))
+                {
+                    chars[k++] = c;
+                }
+            }
+            i = j;
+        }
+        return k;
+    }
+};
+```
 
+### **Go**
+
+```go
+func compress(chars []byte) int {
+	i, k, n := 0, 0, len(chars)
+	for i < n {
+		j := i + 1
+		for j < n && chars[j] == chars[i] {
+			j++
+		}
+		chars[k] = chars[i]
+		k++
+		if j-i > 1 {
+			cnt := strconv.Itoa(j - i)
+			for _, c := range cnt {
+				chars[k] = byte(c)
+				k++
+			}
+		}
+		i = j
+	}
+	return k
+}
 ```
 
 ### **...**

solution/0400-0499/0443.String Compression/README_EN.md

@@ -69,13 +69,97 @@ Could you solve it using only <code>O(1)</code> extra space?</p>
 ### **Python3**
 
 ```python
-
+class Solution:
+    def compress(self, chars: List[str]) -> int:
+        i, k, n = 0, 0, len(chars)
+        while i < n:
+            j = i + 1
+            while j < n and chars[j] == chars[i]:
+                j += 1
+            chars[k] = chars[i]
+            k += 1
+            if j - i > 1:
+                cnt = str(j - i)
+                for c in cnt:
+                    chars[k] = c
+                    k += 1
+            i = j
+        return k
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int compress(char[] chars) {
+        int k = 0, n = chars.length;
+        for (int i = 0, j = i + 1; i < n;) {
+            while (j < n && chars[j] == chars[i]) {
+                ++j;
+            }
+            chars[k++] = chars[i];
+            if (j - i > 1) {
+                String cnt = String.valueOf(j - i);
+                for (char c : cnt.toCharArray()) {
+                    chars[k++] = c;
+                }
+            }
+            i = j;
+        }
+        return k;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int compress(vector<char> &chars) {
+        int k = 0, n = chars.size();
+        for (int i = 0, j = i + 1; i < n;)
+        {
+            while (j < n && chars[j] == chars[i])
+                ++j;
+            chars[k++] = chars[i];
+            if (j - i > 1)
+            {
+                for (char c : to_string(j - i))
+                {
+                    chars[k++] = c;
+                }
+            }
+            i = j;
+        }
+        return k;
+    }
+};
+```
 
+### **Go**
+
+```go
+func compress(chars []byte) int {
+	i, k, n := 0, 0, len(chars)
+	for i < n {
+		j := i + 1
+		for j < n && chars[j] == chars[i] {
+			j++
+		}
+		chars[k] = chars[i]
+		k++
+		if j-i > 1 {
+			cnt := strconv.Itoa(j - i)
+			for _, c := range cnt {
+				chars[k] = byte(c)
+				k++
+			}
+		}
+		i = j
+	}
+	return k
+}
 ```
 
 ### **...**

solution/0400-0499/0443.String Compression/Solution.cpp

@@ -1,29 +1,21 @@
 class Solution {
 public:
-    int compress(vector<char>& chars) {
-        char pre = chars[0] ;
-        int cnt = 1 ;
-        int len = 0 ;
-        for (int i = 1; ; ++i)
+    int compress(vector<char> &chars) {
+        int k = 0, n = chars.size();
+        for (int i = 0, j = i + 1; i < n;)
         {
-            if (i < chars.size() && chars[i] == pre)
-                ++cnt ;
-            else
+            while (j < n && chars[j] == chars[i])
+                ++j;
+            chars[k++] = chars[i];
+            if (j - i > 1)
             {
-                chars[len++] = pre ;
-                
-                if (cnt > 1)
-                    for (auto c: to_string(cnt))
-                        chars[len++] = c ;
-
-                if (i >= chars.size())
-                    break ;
-                
-                pre = chars[i] ;
-                cnt = 1 ;
+                for (char c : to_string(j - i))
+                {
+                    chars[k++] = c;
+                }
             }
+            i = j;
         }
-        
-        return len ;
+        return k;
     }
 };

solution/0400-0499/0443.String Compression/Solution.go

@@ -0,0 +1,20 @@
+func compress(chars []byte) int {
+	i, k, n := 0, 0, len(chars)
+	for i < n {
+		j := i + 1
+		for j < n && chars[j] == chars[i] {
+			j++
+		}
+		chars[k] = chars[i]
+		k++
+		if j-i > 1 {
+			cnt := strconv.Itoa(j - i)
+			for _, c := range cnt {
+				chars[k] = byte(c)
+				k++
+			}
+		}
+		i = j
+	}
+	return k
+}

solution/0400-0499/0443.String Compression/Solution.java

@@ -0,0 +1,19 @@
+class Solution {
+    public int compress(char[] chars) {
+        int k = 0, n = chars.length;
+        for (int i = 0, j = i + 1; i < n;) {
+            while (j < n && chars[j] == chars[i]) {
+                ++j;
+            }
+            chars[k++] = chars[i];
+            if (j - i > 1) {
+                String cnt = String.valueOf(j - i);
+                for (char c : cnt.toCharArray()) {
+                    chars[k++] = c;
+                }
+            }
+            i = j;
+        }
+        return k;
+    }
+}

solution/0400-0499/0443.String Compression/Solution.py

@@ -0,0 +1,16 @@
+class Solution:
+    def compress(self, chars: List[str]) -> int:
+        i, k, n = 0, 0, len(chars)
+        while i < n:
+            j = i + 1
+            while j < n and chars[j] == chars[i]:
+                j += 1
+            chars[k] = chars[i]
+            k += 1
+            if j - i > 1:
+                cnt = str(j - i)
+                for c in cnt:
+                    chars[k] = c
+                    k += 1
+            i = j
+        return k