-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSortArrayByParity.py
More file actions
33 lines (30 loc) · 947 Bytes
/
SortArrayByParity.py
File metadata and controls
33 lines (30 loc) · 947 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
# def sortArrayByParity(nums):
# ret = []
# for i in nums:
# print(i)
# if not len(ret):
# ret.append(i)
# else:
# print ('mod',i%2)
# if i % 2 == 0 or i == 0:
# ret.insert(0, i)
# else:
# ret.append(i)
#
# print(ret)
# return ret
# print(sortArrayByParity([0,1]))
def sortArrayByParity(nums):
#มี pointer สำหรับชี้ว่าตอนนี้เราอยู่ที่ index ไหน ซ้าย - ขวา
left = 0
right = len(nums)-1
#ถ้าตน.ซ้าย < ขวา = ขยับไปเรื่อย
while left < right:
if nums[left] % 2 == 0:
left += 1
elif nums[right] % 2 == 1:
right -= 1
else:
nums[left],nums[right] = nums[right],nums[left]
return nums
print(sortArrayByParity([0, 1]))