Add solution and test-cases for problem 3163

Author: 0xff-dev

leetcode/3101-3200/3163.String-Compression-III/README.md

@@ -1,28 +1,44 @@
 # [3163.String Compression III][title]
 
-> [!WARNING|style:flat]
-> This question is temporarily unanswered if you have good ideas. Welcome to [Create Pull Request PR](https://github.com/kylesliu/awesome-golang-algorithm)
-
 ## Description
+Given a string `word`, compress it using the following algorithm:
+
+- Begin with an empty string `comp`. While `word` is **not** empty, use the following operation:
+
+    - Remove a maximum length prefix of `word` made of a single character `c` repeating **at most** 9 times.
+    - Append the length of the prefix followed by `c` to `comp`.
+
+Return the string `comp`.
 
 **Example 1:**
 
 ```
-Input: a = "11", b = "1"
-Output: "100"
-```
+Input: word = "abcde"
+
+Output: "1a1b1c1d1e"
 
-## 题意
-> ...
+Explanation:
 
-## 题解
+Initially, comp = "". Apply the operation 5 times, choosing "a", "b", "c", "d", and "e" as the prefix in each operation.
 
-### 思路1
-> ...
-String Compression III
-```go
+For each prefix, append "1" followed by the character to comp.
 ```
 
+**Example 2:**
+
+```
+Input: word = "aaaaaaaaaaaaaabb"
+
+Output: "9a5a2b"
+
+Explanation:
+
+Initially, comp = "". Apply the operation 3 times, choosing "aaaaaaaaa", "aaaaa", and "bb" as the prefix in each operation.
+
+For prefix "aaaaaaaaa", append "9" followed by "a" to comp.
+For prefix "aaaaa", append "5" followed by "a" to comp.
+For prefix "bb", append "2" followed by "b" to comp.
+```
 
 ## 结语
 

leetcode/3101-3200/3163.String-Compression-III/Solution.go

@@ -1,5 +1,33 @@
 package Solution
 
-func Solution(x bool) bool {
-	return x
+import "strings"
+
+func Solution(word string) string {
+	buf := strings.Builder{}
+	count := uint8(1)
+	bs := []byte(word)
+	pre := bs[0]
+	for i := 1; i < len(bs); i++ {
+		b := bs[i]
+		if b == pre {
+			count++
+			if count == 9 {
+				buf.WriteByte(count + '0')
+				buf.WriteByte(b)
+				count = 0
+			}
+			continue
+		}
+		if count != 0 {
+			buf.WriteByte(count + '0')
+			buf.WriteByte(pre)
+		}
+		pre = b
+		count = 1
+	}
+	if count != 0 {
+		buf.WriteByte(count + '0')
+		buf.WriteByte(pre)
+	}
+	return buf.String()
 }

leetcode/3101-3200/3163.String-Compression-III/Solution_test.go

@@ -10,12 +10,11 @@ func TestSolution(t *testing.T) {
 	//	测试用例
 	cases := []struct {
 		name   string
-		inputs bool
-		expect bool
+		inputs string
+		expect string
 	}{
-		{"TestCase", true, true},
-		{"TestCase", true, true},
-		{"TestCase", false, false},
+		{"TestCase1", "abcde", "1a1b1c1d1e"},
+		{"TestCase2", "aaaaaaaaaaaaaabb", "9a5a2b"},
 	}
 
 	//	开始测试
@@ -30,10 +29,10 @@ func TestSolution(t *testing.T) {
 	}
 }
 
-//	压力测试
+// 压力测试
 func BenchmarkSolution(b *testing.B) {
 }
 
-//	使用案列
+// 使用案列
 func ExampleSolution() {
 }