PAT A-1140 Look-and-say Sequence

本题链接：1140 Look-and-say Sequence - PAT (Advanced Level) Practice (pintia.cn)

题意：

  本题为统计数字的数量题，较为简单

代码：

#include<iostream>
#include<algorithm>
#include<string>
using namespace std;

int main() {
	string d;
	int n;
	cin >> d >> n;
	
	string num = d;
	string newNum = "";
	for (int i = 0; i < n - 1; i++) {
		int nowNum = 0;
		int nowDig = 0;
		newNum.clear();
		for (int j = 0; j < num.size(); j++) {
			if (j == 0) {
				nowNum = num[j] - '0';
				nowDig = 1;
			}
			else {
				if (num[j] - '0' != nowNum) {
					newNum += char(nowNum + '0');
					newNum += char(nowDig + '0');
					nowNum = num[j] - '0';
					nowDig = 1;
				}
				else {
					nowDig++;
				}
			}
		}
		newNum += char(nowNum + '0');
		newNum += char(nowDig + '0');
		num = newNum;
	}
	cout << num;

	return 0;
}