-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathstring.reverseWordOrder.js
More file actions
58 lines (48 loc) · 1.22 KB
/
string.reverseWordOrder.js
File metadata and controls
58 lines (48 loc) · 1.22 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
53
54
55
56
57
58
/*
* @title: Reverse order of words
* @description: String function to reverse the order of words
* @author: Thorsten Kober
* @email: [email protected]
*/
function reverseWord(arr, start, end) {
while (start < end) {
const temp = arr[start];
arr[start] = arr[end];
arr[end] = temp;
start++;
end--;
}
}
function reverseWords(arr) {
arr = arr.reverse();
let start = 0;
for (let i = 0; i <= arr.length; i++) {
if (i === arr.length || arr[i] === ' ') {
reverseWord(arr, start, i - 1);
start = i + 1;
}
}
return arr.join('');
}
function reverseWords2(str) {
const arr = str.split(' ');
for (let i = 0; i < arr.length; i++) {
if (arr[i] === '') {
arr.splice(i, 1);
i--;
}
}
reverseWord(arr, 0, arr.length - 1);
return arr.join(' ').trim();
}
// npx jest algorithms/string/string.reverseWordOrder.js
test('test reverse words', () => {
const message = ['c', 'a', 'k', 'e', ' ',
'p', 'o', 'u', 'n', 'd', ' ',
's', 't', 'e', 'a', 'l'];
expect(reverseWords(message)).toEqual('steal pound cake');
});
test('test reverse words', () => {
const message = 'the sky is blue';
expect(reverseWords2(message)).toEqual('blue is sky the');
});