-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path922-SortArrayByParityII.go
More file actions
82 lines (71 loc) · 2.17 KB
/
922-SortArrayByParityII.go
File metadata and controls
82 lines (71 loc) · 2.17 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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
package main
// 922. Sort Array By Parity II
// Given an array of integers nums, half of the integers in nums are odd, and the other half are even.
// Sort the array so that whenever nums[i] is odd, i is odd, and whenever nums[i] is even, i is even.
// Return any answer array that satisfies this condition.
// Example 1:
// Input: nums = [4,2,5,7]
// Output: [4,5,2,7]
// Explanation: [4,7,2,5], [2,5,4,7], [2,7,4,5] would also have been accepted.
// Example 2:
// Input: nums = [2,3]
// Output: [2,3]
// Constraints:
// 2 <= nums.length <= 2 * 10^4
// nums.length is even.
// Half of the integers in nums are even.
// 0 <= nums[i] <= 1000
// Follow Up: Could you solve it in-place?
import "fmt"
func sortArrayByParityII(nums []int) []int {
res, even, odd := []int{}, []int{}, []int{}
for _, v := range nums {
if v % 2 == 0 {
even = append(even, v)
} else {
odd = append(odd, v)
}
}
for i := 0; i < len(nums) / 2; i++ {
res = append(res, even[i])
res = append(res, odd[i])
}
return res
}
// 快慢指针
func sortArrayByParityII1(nums []int) []int {
slow, fast, n := 0, 0, len(nums)
for slow < n {
if slow % 2 == 0 {
for fast < n && nums[fast] % 2 != 0 {
fast++
}
if slow != fast {
nums[slow], nums[fast] = nums[fast], nums[slow]
}
} else {
for fast < n && nums[fast] % 2 == 0 {
fast++
}
if slow != fast {
nums[slow], nums[fast] = nums[fast], nums[slow]
}
}
slow++
fast = slow
}
return nums
}
func main() {
// Example 1:
// Input: nums = [4,2,5,7]
// Output: [4,5,2,7]
// Explanation: [4,7,2,5], [2,5,4,7], [2,7,4,5] would also have been accepted.
fmt.Println(sortArrayByParityII([]int{4,2,5,7})) // [4,5,2,7]
// Example 2:
// Input: nums = [2,3]
// Output: [2,3]
fmt.Println(sortArrayByParityII([]int{2,3})) // [2,3]
fmt.Println(sortArrayByParityII1([]int{4,2,5,7})) // [4,5,2,7]
fmt.Println(sortArrayByParityII1([]int{2,3})) // [2,3]
}