给定只含 "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"
。
最大值就是size
,最小值是0
,相当于一个贪心吧
class Solution {
public:
vector<int> diStringMatch(string S) {
vector<int> ans(S.size() + 1);
int minn = 0, maxn = S.size();
for (int i = 0; i < S.size(); ++i)
if (S[i] == 'I')
ans[i] = minn++;
else
ans[i] = maxn--;
ans.back() = maxn;
return ans;
}
};