-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCountAndSay.java
59 lines (55 loc) · 1.4 KB
/
CountAndSay.java
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
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
package easy;
/**
* The count-and-say sequence is the sequence of integers with the first five terms as following:
*
* 1. 1
* 2. 11
* 3. 21
* 4. 1211
* 5. 111221
* 6. 312211
*
* 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 term of the count-and-say sequence.
* Note: Each term of the sequence of integers will be represented as a string.
*
* Example 1:
* Input: 1
* Output: "1"
* Example 2:
* Input: 4
* Output: "1211"
*
* 解决思路:
* 计数
*
* Created by second on 2017/9/28.
*/
public class CountAndSay {
public String countAndSay(int n) {
String str = "1";
StringBuilder builder = new StringBuilder();
for (int i = 1; i < n; i++){
int count = 0;
char prev = str.charAt(0);
for (int j = 0; j < str.length(); j++){
if (prev != str.charAt(j)){
builder.append(count);
builder.append(prev);
count = 1;
}else {
count++;
}
prev = str.charAt(j);
}
builder.append(count);
builder.append(prev);
str = builder.toString();
builder.delete(0, builder.length());
}
return str;
}
}