PAT 1140 Look-and-say Sequence

题目链接：点击打开链接

思路：模拟即可

#include <bits/stdc++.h>
using namespace std;
vector<int> v;
int main(){
	int n;
	string num;
	cin >> num >> n;
	for(int i = 1;i < n;i++){
		int nex;
		string te;
		te.clear();
		for(int j = 0;j < num.size();j = nex){
			int cnt = 1;
			v.clear();
			for(nex = j + 1;nex < num.size() && num[nex] == num[j];nex++){
				cnt++;
			}
			te.append(1,num[j]);
			/*while(cnt){
				v.push_back(cnt % 10);
				cnt /= 10;
			}
			for(int k = v.size() - 1;k >= 0;k--){
				te.append(1,(char)('0' + v[k]));
			}*/
			te += std::to_string(cnt);//c++11标准 
		}
		num = te;
	}
	cout<<num<<endl;
	return 0;
}