38. Count and Say

LeetCode

Recursion link

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
class Solution {
public String countAndSay(int n) {
if(n == 1) return "1";
String prev = countAndSay(n - 1);
StringBuilder str = new StringBuilder();
int i = 0;
while(i < prev.length()) {
char curr = prev.charAt(i);
int j = 0;
while(i+j < prev.length() && prev.charAt(i+j) == curr) j++;
str.append(j);
str.append(curr);
i += j;
}
return str.toString();
}
}

0%