Files
2026-05-04 20:06:06 +01:00

27 lines
683 B
C++

class Solution {
public:
string reverseWords(string s) {
reverse(s.begin(), s.end());
int n = s.size();
int left = 0;
int right = 0;
int i = 0;
while (i < n) {
while (i < n && s[i] == ' ')
i++;
if (i == n)
break;
while (i < n && s[i] != ' ') {
s[right++] = s[i++];
}
reverse(s.begin() + left, s.begin() + right);
s[right++] = ' ';
left = right;
i++;
}
s.resize(right - 1);
return s;
}
};
// Makes a reverse of the string whilst keeping word spelling the same