-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path151. Reverse Words in a String.cpp
91 lines (67 loc) · 1.72 KB
/
151. Reverse Words in a String.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
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
class Solution {
public:
string reverseWords(string s) {
string ans = "";
int i = s.size()-1;
while( i >= 0){
while(i >= 0 && s[i] == ' '){
i--;
}
if(i < 0) break;
int j = i;
while(i >= 0 && s[i] != ' '){
i--;
}
ans += s.substr(i+1,j-i);
ans += " ";
}
string res = ans.substr(0 , ans.size()-1);
return res ;
}
};
//leetcode
class Solution {
public:
string reverseWords(string s) {
reverse(s.begin() , s.end()) ;
int l = 0 , r = 0 , n = s.size();
int i = 0;
while(i < n){
while( i<n && s[i] != ' '){
s[r++] = s[i++];
}
if(l < r){
reverse(s.begin()+l , s.begin()+r);
s[r] = ' ';
r++;
l = r;
}
i++ ;
}
s = s.substr(0,r-1);
return s;
}
};
//gfg
class Solution {
public:
// Function to reverse words in a given string.
string reverseWords(string str) {
// code here
int n = str.size();
string temp = "", ans = "";
for(int i = 0 ; i < n; i++){
if(str[i] == '.' ){
ans = temp + ans;
ans = str[i] + ans;
temp = "";
continue;
}
temp += str[i] ;
if(i == n-1){
ans = temp + ans;
}
}
return ans;
}
};