-
Notifications
You must be signed in to change notification settings - Fork 0
/
Reverse the words.cpp
46 lines (33 loc) · 1.28 KB
/
Reverse the words.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
Given an input string s, reverse the order of the words.
A word is defined as a sequence of non-space characters. The words in s will be separated by at least one space.
Return a string of the words in reverse order concatenated by a single space.
Note that s may contain leading or trailing spaces or multiple spaces between two words. The returned string should only have a single space separating the words. Do not include any extra spaces.
Example 1:
Input: s = "the sky is blue"
Output: "blue is sky the"
Example 2:
Input: s = " hello world "
Output: "world hello"
Explanation: Your reversed string should not contain leading or trailing spaces.
Example 3:
Input: s = "a good example"
Output: "example good a"
Explanation: You need to reduce multiple spaces between two words to a single space in the reversed string.
code*****
class Solution {
public:
string reverseWords(string s) {
stringstream ss(s); //STRINGSREAM IS FUNCTION USED TO COUNT THE WORKDS OF GIVEN STRING
string line;
vector<string> v;
while(ss>>line){
v.push_back(line);
}
string ans;
for(int i = v.size()-1;i>=0;i--){
ans+= v[i] + " ";
}
ans.pop_back();
return ans;
}
};