LeetCode 38. Count and Say 报数

解法一：

string countAndSay(int n) {

if (n == 0) return "";

string res = "1";

while (--n) {

string cur = "";

for (int i = 0; i < res.size(); i++) {

int count = 1;

while ((i + 1 < res.size()) && (res[i] == res[i + 1])){

count++;

i++;

}

cur += to_string(count) + res[i];

}

res = cur;

}

return res;

}

解法二：

class Solution {
public:
string countAndSay(int n) {
string s("1");
while (--n)
s = getNext(s);
return s;
}
string getNext(const string &s) {
stringstream ss;

for (auto i = s.begin(); i != s.end(); ) {
auto j = find_if(i, s.end(), bind1st(not_equal_to<char>(), *i));
ss << distance(i, j) << *i;
i = j;
}
return ss.str();
}
};