|快慢指標 定位不重複元素下標|17冬第一題1140Look-and-say Sequence (20分)
阿新 • • 發佈:2021-01-28
技術標籤:PAT甲
#include<iostream>
#include<string>
using namespace std;
int main() {
string s;
int n;
cin >> s >> n;
while (--n) {
string tmp;
int i, j;//2個指標
//1121
for (i = 0; i < s.length(); i = j) {
//i=0
//i=2
//i=3
for (j = i; j < s.length() && s[i] == s[j]; j++);
//i=j=0
//s[0]=s[0]、s[0]=s[1]//i=0,j=2//j-i=2//s[i]=1
//i=j=2
//s[2]=s[2]//i=2,j=3//j-i=1//s[i]=2
//i=j=3
//s[3]=s[3]//i=3,j=4//j-i=1//s[i]=1
tmp += s[i];
tmp += j - i + '0';
}
s = tmp;//122111
}
cout << s;
return 0;
}