-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path905.SortArrayByParity.js
More file actions
53 lines (40 loc) · 1.04 KB
/
905.SortArrayByParity.js
File metadata and controls
53 lines (40 loc) · 1.04 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
/*
Given an integer array nums, move all the even integers at the beginning of the array followed by all the odd integers.
Return any array that satisfies this condition.
Example 1:
Input: nums = [3,1,2,4]
Output: [2,4,3,1]
Explanation: The outputs [4,2,3,1], [2,4,1,3], and [4,2,1,3] would also be accepted.
Example 2:
Input: nums = [0]
Output: [0]
*/
// Naive Approach
const nums = [3, 1, 2, 4];
var sortArrayByParity = function (nums) {
if (nums.length === 1) return nums;
var result = [];
for (let i = 0; i < nums.length; i++) {
if (nums[i] % 2 !== 0) {
result.push(nums[i]);
} else {
result.unshift(nums[i]);
}
}
return result;
};
console.log(sortArrayByParity(nums));
// Optimized approach
const nums2 = [3, 1, 2, 4];
var sortArrayByParity2 = function (nums) {
let index = 0;
for (let i = 0; i < nums.length; i++) {
if (nums[i] % 2 === 0) {
var temp = nums[index];
nums[index++] = nums[i];
nums[i] = temp;
}
}
return nums;
};
console.log(sortArrayByParity2(nums2));