forked from fishercoder1534/Leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCountandSay.java
36 lines (31 loc) · 1.08 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
package com.fishercoder.solutions;
public class CountandSay {
/**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.*/
public String countAndSay(int n) {
StringBuilder curr = new StringBuilder("1");
StringBuilder prev;
int count;
char say;
for(int i = 1; i < n; i++){
prev = curr;
curr = new StringBuilder();
count = 1;
say = prev.charAt(0);
for(int j = 1, len = prev.length(); j < len; j++){
if(prev.charAt(j) != say){
curr.append(count).append(say);
count = 1;
say = prev.charAt(j);
} else count++;
}
curr.append(count).append(say);
}
return curr.toString();
}
}