首页 > 代码库 > Reverse Words in a String
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.
分析：细节实现题，注意leading和trailing space。代码如下：
class Solution {public: void reverseWords(string &s) { int n = s.length(); if(n == 0) return; vector<string> pool; int i = 0; while(s[i] == ‘ ‘)i++; string tmp; for(int j = i; j < n; j++){ if(s[j] != ‘ ‘){ tmp.push_back(s[j]); if(j == n-1) pool.push_back(tmp); } else{ if(s[j-1] != ‘ ‘){ pool.push_back(tmp); tmp.clear(); } } } s.clear(); for(auto a = pool.rbegin(); a != pool.rend(); a++){ s.append(*a); s.push_back(‘ ‘); } if(s.length() != 0) s.pop_back(); }};
Reverse Words in a String
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。