给定只含 "I"(增大)或 "D"(减小)的字符串 S ,令 N = S.length。
返回 [0, 1, ..., N] 的任意排列 A 使得对于所有 i = 0, ..., N-1,都有:
如果 S[i] == "I",那么 A[i] < A[i+1]
如果 S[i] == "D",那么 A[i] > A[i+1]
示例 1:
输出:"IDID"
输出:[0,4,1,3,2]
示例 2:
输出:"III"
输出:[0,1,2,3]
示例 3:
输出:"DDI"
输出:[3,2,0,1]
提示:
1 <= S.length <= 1000
S 只包含字符 "I" 或 "D"。
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/di-string-match
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
class Solution {
public:
vector<int> diStringMatch(string S) {
int N = S.length();
int lo = 0, hi = N;
vector<int> ans(N+1);
//int[] ans = new int[N + 1];
for (int i = 0; i < N; ++i) {
if (S[i] == 'I')
ans[i] = lo++;
else
ans[i] = hi--;
}
cout<<lo<<endl;
cout<<hi<<endl;
ans[N] = lo;
return ans;
}
};