class Solution {
public:
vector<int> diStringMatch(string S) {
int max = S.size(), min = 0;
vector<int> src(0);
if (max <= 0)
return src;
for (auto it : S)
{
if ('I' == it)
src.push_back(min++);
else
src.push_back(max--);
}
src.push_back(max);
return src;
}
};
增减字符串匹配
最新推荐文章于 2024-08-14 16:34:53 发布