class Solution {
public:
vector<int> findPermutation(string s) {
int n = s.length();
if (!n) return vector<int>();
vector<int> res(n+1);
for (int i = 0; i < n+1; i++) res[i] = i+1; //初始增序序列
//一次遍历字符串
for (int i = 0; i < n; i++) {
int start = 0, end = 0;
if (s[i] == 'D') { //找'D'
start = i; //记录起始位置
while(s[i+1] == 'D') i++;
end = i; //记录结束位置
reverse(res.begin()+start, res.begin()+end+2); //将对应位置的段落整体反转
}
}
return res;
}
};