4.14
public class Solution {
/**
* @param n the nth
* @return the nth sequence
*/
public String countAndSay(int n) {
String res = "1";
String[] tmp = new String[n];
String s = Integer.toBinaryString(n);
if(n == 1){
return res;
}
else{
tmp[0] = "1";
for(int i = 1;i < n; i++){
String tmp_s = tmp[i-1];
tmp[i] = null;
int count = 1;
int num;
for(int j = 0;j < tmp_s.length();j++){
num = tmp_s.charAt(j) - 49;
while(j<tmp_s.length()-1 && tmp_s.charAt(j)== tmp_s.charAt(j+1)){
j++;
count++;
}
tmp[i] += Integer.toBinaryString(count);
tmp[i] += Integer.toString(num);
count = 1;
}
}
}
return s;// Write your code here
}
}