/*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.
Example 4:
Input: s = " Bob Loves Alice "
Output: “Alice Loves Bob”
Example 5:
Input: s = “Alice does not even like bob”
Output: “bob like even not does Alice”
Constraints:
1 <= s.length <= 104
s contains English letters (upper-case and lower-case), digits, and spaces ’ '.
There is at least one word in s.
Follow up: Could you solve it in-place with O(1) extra space? */
class Solution {
public:
string reverseWords(string s) {
reverse(s.begin(),s.end());
s.insert(s.end(), ' ');
//insert() is used to insert characters in string at specified position.
int start = 0;
int length = s.size();
for(int i =0;i<length;i++){
if(s[i]==' '){
reverse(s.begin()+start,s.begin()+i);
// what this logic do
start = i+1;
}
}
s.pop_back();
// Erases the last character of the string, effectively reducing its length by one.
return s;
}
};
// my code is not working for all test cases please help me @ aman yadav sir