feat: update solutions to lc problem: No.0038

No.0038.Count and Say

Author: yanglbme

solution/0000-0099/0038.Count and Say/README.md

@@ -69,7 +69,6 @@ countAndSay(4) = 读 "21" = 一 个 2 + 一 个 1 = "12" + "11" = "1211"
 	<li><code>1 <= n <= 30</code></li>
 </ul>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->
@@ -81,15 +80,95 @@ countAndSay(4) = 读 "21" = 一 个 2 + 一 个 1 = "12" + "11" = "1211"
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def countAndSay(self, n: int) -> str:
+        s = '1'
+        for _ in range(n - 1):
+            i = 0
+            t = []
+            while i < len(s):
+                j = i
+                while j < len(s) and s[j] == s[i]:
+                    j += 1
+                t.append(str(j - i))
+                t.append(str(s[i]))
+                i = j
+            s = ''.join(t)
+        return s
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public String countAndSay(int n) {
+        String s = "1";
+        while (--n > 0) {
+            StringBuilder t = new StringBuilder();
+            for (int i = 0; i < s.length();) {
+                int j = i;
+                while (j < s.length() && s.charAt(j) == s.charAt(i)) {
+                    ++j;
+                }
+                t.append((j - i) + "");
+                t.append(s.charAt(i));
+                i = j;
+            }
+            s = t.toString();
+        }
+        return s;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    string countAndSay(int n) {
+        string s = "1";
+        while (--n)
+        {
+            string t = "";
+            for (int i = 0; i < s.size();)
+            {
+                int j = i;
+                while (j < s.size() && s[j] == s[i]) ++j;
+                t += to_string(j - i);
+                t += s[i];
+                i = j;
+            }
+            s = t;
+        }
+        return s;
+    }
+};
+```
 
+### **Go**
+
+```go
+func countAndSay(n int) string {
+	s := "1"
+	for k := 0; k < n-1; k++ {
+		t := &strings.Builder{}
+		i := 0
+		for i < len(s) {
+			j := i
+			for j < len(s) && s[j] == s[i] {
+				j++
+			}
+			t.WriteString(strconv.Itoa(j - i))
+			t.WriteByte(s[i])
+			i = j
+		}
+		s = t.String()
+	}
+	return s
+}
 ```
 
 ### **...**

solution/0000-0099/0038.Count and Say/README_EN.md

@@ -45,21 +45,100 @@ countAndSay(4) = say "21" = one 2 + one 1 = "12" + "11&
 	<li><code>1 &lt;= n &lt;= 30</code></li>
 </ul>
 
-
 ## Solutions
 
 <!-- tabs:start -->
 
 ### **Python3**
 
 ```python
-
+class Solution:
+    def countAndSay(self, n: int) -> str:
+        s = '1'
+        for _ in range(n - 1):
+            i = 0
+            t = []
+            while i < len(s):
+                j = i
+                while j < len(s) and s[j] == s[i]:
+                    j += 1
+                t.append(str(j - i))
+                t.append(str(s[i]))
+                i = j
+            s = ''.join(t)
+        return s
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public String countAndSay(int n) {
+        String s = "1";
+        while (--n > 0) {
+            StringBuilder t = new StringBuilder();
+            for (int i = 0; i < s.length();) {
+                int j = i;
+                while (j < s.length() && s.charAt(j) == s.charAt(i)) {
+                    ++j;
+                }
+                t.append((j - i) + "");
+                t.append(s.charAt(i));
+                i = j;
+            }
+            s = t.toString();
+        }
+        return s;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    string countAndSay(int n) {
+        string s = "1";
+        while (--n)
+        {
+            string t = "";
+            for (int i = 0; i < s.size();)
+            {
+                int j = i;
+                while (j < s.size() && s[j] == s[i]) ++j;
+                t += to_string(j - i);
+                t += s[i];
+                i = j;
+            }
+            s = t;
+        }
+        return s;
+    }
+};
+```
 
+### **Go**
+
+```go
+func countAndSay(n int) string {
+	s := "1"
+	for k := 0; k < n-1; k++ {
+		t := &strings.Builder{}
+		i := 0
+		for i < len(s) {
+			j := i
+			for j < len(s) && s[j] == s[i] {
+				j++
+			}
+			t.WriteString(strconv.Itoa(j - i))
+			t.WriteByte(s[i])
+			i = j
+		}
+		s = t.String()
+	}
+	return s
+}
 ```
 
 ### **...**

solution/0000-0099/0038.Count and Say/Solution.cpp

@@ -0,0 +1,20 @@
+class Solution {
+public:
+    string countAndSay(int n) {
+        string s = "1";
+        while (--n)
+        {
+            string t = "";
+            for (int i = 0; i < s.size();)
+            {
+                int j = i;
+                while (j < s.size() && s[j] == s[i]) ++j;
+                t += to_string(j - i);
+                t += s[i];
+                i = j;
+            }
+            s = t;
+        }
+        return s;
+    }
+};

solution/0000-0099/0038.Count and Say/Solution.go

@@ -1,22 +1,18 @@
 func countAndSay(n int) string {
-	buf := bytes.NewBufferString("1")
-	for i := 2; i <= n; i++ {
-		s := buf.String()
-		c, l := s[0:1], len(s)
-		buf.Reset()
-		count := 0
-		for j := 0; j < l; j++ {
-			if c == s[j:j+1] {
-				count++
-			} else {
-				buf.WriteByte(byte(48 + count))
-				buf.WriteString(c)
-				count = 1
-				c = s[j : j+1]
+	s := "1"
+	for k := 0; k < n-1; k++ {
+		t := &strings.Builder{}
+		i := 0
+		for i < len(s) {
+			j := i
+			for j < len(s) && s[j] == s[i] {
+				j++
 			}
+			t.WriteString(strconv.Itoa(j - i))
+			t.WriteByte(s[i])
+			i = j
 		}
-		buf.WriteByte(byte(48 + count))
-		buf.WriteString(c)
+		s = t.String()
 	}
-	return buf.String()
-}
+	return s
+}

solution/0000-0099/0038.Count and Say/Solution.java

@@ -1,23 +1,19 @@
 class Solution {
     public String countAndSay(int n) {
-        String one = "1";
-        while (n > 1) {
-            one = say(one);
-            n--;
-        }
-        return one;
-    }
-
-    private String say(String las) {
-        StringBuilder sBuilder = new StringBuilder();
-        int l = 1;
-        for (int i = 0; i < las.length(); i++) {
-            if (i < las.length() - 1 && las.charAt(i) == las.charAt(i + 1)) l++;
-            else {
-                sBuilder.append(l).append(las.charAt(i));
-                l = 1;
+        String s = "1";
+        while (--n > 0) {
+            StringBuilder t = new StringBuilder();
+            for (int i = 0; i < s.length();) {
+                int j = i;
+                while (j < s.length() && s.charAt(j) == s.charAt(i)) {
+                    ++j;
+                }
+                t.append((j - i) + "");
+                t.append(s.charAt(i));
+                i = j;
             }
+            s = t.toString();
         }
-        return sBuilder.toString();
+        return s;
     }
 }

solution/0000-0099/0038.Count and Say/Solution.py

@@ -1,18 +1,15 @@
-class Solution(object):
-    def countAndSay(self, n):
-        s = '1'   #初始化第一个数字    
-        for i in range(n-1):  #n-1个数      
-            temp = ''   #一个空数列
-            num = s[0]  #s的第一位数字
-            count = 0    #当前数字的个数
-            
-            for j in s:   #遍历s中的每个字母
-                if num == j:     #如果这个字母和num一样
-                    count += 1     #计数+1
-                else:
-                    temp += str(count)+str(num)  #存下“几”个“什么数”
-                    num = j   #num改成当前数字
-                    count = 1   #计数回到1
-            temp += str(count)+str(num)  #加的是最后一个
-            s = temp
+class Solution:
+    def countAndSay(self, n: int) -> str:
+        s = '1'
+        for _ in range(n - 1):
+            i = 0
+            t = []
+            while i < len(s):
+                j = i
+                while j < len(s) and s[j] == s[i]:
+                    j += 1
+                t.append(str(j - i))
+                t.append(str(s[i]))
+                i = j
+            s = ''.join(t)
         return s