-
Notifications
You must be signed in to change notification settings - Fork 6
/
Copy pathreverse_words_in_string.js
49 lines (46 loc) · 1.23 KB
/
reverse_words_in_string.js
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
// Given an input string, reverse the string word by word.
//
//
//
// Example 1:
//
// Input: "the sky is blue"
// Output: "blue is sky the"
// Example 2:
//
// Input: " hello world! "
// Output: "world! hello"
// Explanation: Your reversed string should not contain leading or trailing spaces.
// Example 3:
//
// Input: "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.
//
//
// Note:
//
// A word is defined as a sequence of non-space characters.
// Input string may contain leading or trailing spaces. However, your reversed string should not contain leading or trailing spaces.
// You need to reduce multiple spaces between two words to a single space in the reversed string.
//
//
// Follow up:
//
// For C programmers, try to solve it in-place in O(1) extra space.
/**
* @param {string} s
* @return {string}
*/
var reverseWords = function(s) {
let stringArray = s
.trim()
.split(" ")
.filter(a => a.length > 0);
let out = "";
for (let i = stringArray.length - 1; i >= 0; i--) {
out += stringArray[i] + (i >= 1 ? " " : "");
}
return out;
};
reverseWords("a good example"); //?