class Solution {
public:
vector<int> diStringMatch(string s) {
vector<int> res;
int N = s.size();
int min = 0;
int max = N;
for (int i = 0; i < N; i++) {
if (s[i] == 'I') {
res.push_back(min++);
} else {
res.push_back(max--);
}
}
res.push_back(min);
return res;
}
};
LeetCode #942 增减字符串匹配
最新推荐文章于 2024-07-25 19:34:38 发布