Related Topics：[String]
Similar Questions:[Encode and Decode Strings][String Compression]
題目：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.
這道計(jì)數(shù)和讀法就是對(duì)于前一個(gè)數(shù)软棺，找出相同元素的個(gè)數(shù)及塘，把個(gè)數(shù)和該元素存到新的string里。代碼如下:
java解法：
class Solution {
public String countAndSay(int n) {
if(n<=0) return "";
String res="1";
while(n-1>0) {
String cur="";
int i=0;
while(i<res.length()) {
int count=1;
while((i+1)<res.length()&&res.charAt(i+1)==res.charAt(i)) {
count++;
i++;
}
cur+=Integer.toString(count)+res.charAt(i);
i++;
}
res=cur;
n--;
}
return res;
}
}
