-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathquestion_8.py
More file actions
58 lines (48 loc) · 1.35 KB
/
question_8.py
File metadata and controls
58 lines (48 loc) · 1.35 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
#!/usr/bin/env python
# @Time : 2018/5/1 下午9:30
# @Author : cancan
# @File : question_8.py
# @Function : 移动零
"""
Question:
给定一个数组 nums, 编写一个函数将所有 0 移动到它的末尾,同时保持非零元素的相对顺序。
例如, 定义 nums = [0, 1, 0, 3, 12],调用函数之后, nums 应为 [1, 3, 12, 0, 0]。
Note:
1.必须在原数组上操作,不要为一个新数组分配额外空间。
2.尽量减少操作总数。
"""
class Solution1:
def moveZeroes(self, nums):
"""
:type nums: List[int]
:rtype: void Do not return anything, modify nums in-place instead.
"""
n = []
for i, v in enumerate(nums):
if v == 0:
n.append(i)
l = len(n)
n = reversed(n)
for i in n:
del nums[i]
nums.extend([0] * l)
class Solution2:
def moveZeroes(self, nums):
"""
:type nums: List[int]
:rtype: void Do not return anything, modify nums in-place instead.
"""
i = 0
c = 0
while (i < len(nums) - c):
if nums[i] == 0:
nums.pop(i)
nums.append(0)
c += 1
else:
i += 1
if __name__ == "__main__":
s = Solution2()
d = [0, 1, 0, 3, 12]
s.moveZeroes(d)
print(d)