LeetCode Count and Say

Description:

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.
Solution:

Just simply simulate this procedure.

public class Solution {
public String countAndSay(int n) {
String ans = "1", temp;
char pre;
int num;
for (int i = 1; i < n; i++) {
temp = "";
ans = ans + " ";
pre = ans.charAt(0);
num = 1;
for (int j = 1; j < ans.length(); j++) {
if (ans.charAt(j) != pre) {
temp = temp + num + pre;
num = 1;
pre = ans.charAt(j);
} else {
num++;
}

}
ans = temp;
}

return ans;
}
}