-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathreverseEachWordInAPhrase.js
More file actions
53 lines (37 loc) · 1.3 KB
/
reverseEachWordInAPhrase.js
File metadata and controls
53 lines (37 loc) · 1.3 KB
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
//From leetcode
//https://leetcode.com/problems/two-sum/
// reverse each word in a phrase
// The most awesome way of slving this problem! In one line!!!
function reverseWordsInPhrase (str){
return str.split(" ").reverse().join(" ").split('').reverse().join(" ");
}
reverseWordsInPhrase("I am a good girl");
// function reverseWordsInPhrase(sentence){
// resSentence="";
// var wordsArr = sentence.split(" ");
// for (var i=0; i<wordsArr.length; i++){
// resCurWord = ""
// var curWord = wordsArr[i]
// for (var j=curWord.length-1; j>=0; j--){
// resCurWord+=curWord[j];
// }
// resSentence+=resCurWord+" "
// console.log(resSentence)
// }
// return resSentence.substring(0,sentence.length)
// }
// function reverseWordsInPhrase(sentence){
// var wordsArr = sentence.split(" ");
// for (var i=0; i<wordsArr.length; i++){
// wordsArr[i]=wordsArr[i].split("").reverse().join("");
// }
// return wordsArr.join(" ")
// }
// function reverseWordsInPhrase(sentence){
// var wordsArr = sentence.split(" ");
// for (var i=0; i<wordsArr.length; i++){
// wordsArr[i]=wordsArr[i].split("").reverse().join("");
// }
// return wordsArr.join(" ")
// }
// reverseWordsInPhrase("I am a good girl")