-
Notifications
You must be signed in to change notification settings - Fork 22
Expand file tree
/
Copy path905.sort-array-by-parity.cpp
More file actions
42 lines (40 loc) · 916 Bytes
/
905.sort-array-by-parity.cpp
File metadata and controls
42 lines (40 loc) · 916 Bytes
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
// Tag: Array, Two Pointers, Sorting
// Time: O(N)
// Space: O(1)
// Ref: -
// Note: -
// 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]
//
//
// Constraints:
//
// 1 <= nums.length <= 5000
// 0 <= nums[i] <= 5000
//
//
class Solution {
public:
vector<int> sortArrayByParity(vector<int>& nums) {
int n = nums.size();
int l = 0;
for (int i = 0; i < n; i++) {
if (nums[i] % 2 == 0) {
swap(nums[l], nums[i]);
l += 1;
}
}
return nums;
}
};