首页 > 代码库 > LeetCode--Reverse Words in a String
LeetCode--Reverse Words in a String
Given an input string, reverse the string word by word.
For example,
Given s = "the sky is blue",
return "blue is sky the".
click to show clarification.
Clarification:
- What constitutes a word?
A sequence of non-space characters constitutes a word. - Could the input string contain leading or trailing spaces?
Yes. However, your reversed string should not contain leading or trailing spaces. - How about multiple spaces between two words?
Reduce them to a single space in the reversed string.
class Solution
{
public:
void reverseWords(string &s)
{
vector<string> word;
int n = s.length();
bool flag = false;
string res = "";
for(int i=0; i<n; i++)
{
if(s[i]==' ' && flag==true)
{
word.push_back(res);
flag = false;
res = "";
}
else if(s[i] != ' ')
{
flag = true;
res +=s[i];
}
}
if(flag)
word.push_back(res);
s = "";
n = word.size()-1;
for(int i=n; i>=0; i--)
{
s = s + word[i];
if(i!=0)
s += " ";
}
}
};LeetCode--Reverse Words in a String
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。