forked from mengli/leetcode
- Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathCountandSay.java
More file actions
Latest commit
41 lines (38 loc) · 926 Bytes
/
Copy pathCountandSay.java
File metadata and controls
41 lines (38 loc) · 926 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
/**
* The count-and-say sequence is the sequence of integers beginning as follows:
* 1, 11, 21, 1211, 111221, ...
*
* 1 is read off as "one 1" or 11. 11 is read off as "two 1s" or 21. 21 is read
* off as "one 2, then one 1" or 1211.
*
* Given an integer n, generate the nth sequence.
*
* Note: The sequence of integers will be represented as a string.
*/
publicclassCountandSay {
publicStringcountAndSay(intn) {
StringBuilders1 = newStringBuilder("1");
StringBuilders2 = newStringBuilder();
for (inti = 1; i < n; i++) {
intj = 0;
intlen = s1.length();
while (j < len) {
intcount = 1;
charc = s1.charAt(j);
while (j < len - 1 && s1.charAt(j + 1) == s1.charAt(j)) {
count++;
j++;
}
s2.append(count + "");
s2.append(c);
if (j == len - 1) {
break;
}
j++;
}
s1 = s2;
s2 = newStringBuilder();
}
returns1.toString();
}
}