//翻转单词顺序
class Solution {
public:
string ReverseSentence(string s) {
int k = 0;
for (int i = 0; i < s.size();)
{
int j = i;
while (j < s.size() && s[j] == ) j ++ ;
if (j == s.size()) break;
i = j;
while (j < s.size() && s[j] != ) j ++ ;
reverse(s.begin() + i, s.begin() + j);
if (k) s[k ++ ] = ;
while (i < j) s[k ++ ] = s[i ++ ];
}
//s.erase(s.begin() + k, s.end());
reverse(s.begin(), s.end());
return s;
}
};
class Solution {
public:
string ReverseSentence(string s) {
int k = 0;
for (int i = 0; i < s.size();)
{
int j = i;
while (j < s.size() && s[j] == ) j ++ ;
if (j == s.size()) break;
i = j;
while (j < s.size() && s[j] != ) j ++ ;
reverse(s.begin() + i, s.begin() + j);
if (k) s[k ++ ] = ;
while (i < j) s[k ++ ] = s[i ++ ];
}
//s.erase(s.begin() + k, s.end());
reverse(s.begin(), s.end());
return s;
}
};
2020-05-05
在牛客打卡13天,今天学习:刷题 13 道/代码提交 3 次
全部评论
相关推荐
点赞 评论 收藏
分享