PAT甲级题目1140 Look-and-say Sequence

代码：

#include <bits/stdc++.h>
using namespace std;
vector<int> arr, temp; 
int main(void)
{
	int d, n;
	scanf("%d%d", &d, &n);
	int i, j;
	if (n == 1)
	{
		printf("%d", d);return 0;
	}
	if (n == 2)
	{
		printf("%d1", d);return 0;
	}
	arr.push_back(d);
	arr.push_back(1);
	for (i = 3; i <= n; i++)
	{
		temp.clear();
		for (j = 0; j < arr.size(); j++)
		{
			int cnt = 1;
			while (j < arr.size() - 1 && arr[j] == arr[j+1])
			{
				cnt++; 
                j++;
			}
			temp.push_back(arr[j]);
			temp.push_back(cnt);
		}
		arr = temp;
	}
	for (i = 0; i < arr.size(); i++) printf("%d", arr[i]);
}