283.移动零
题目
给定一个数组nums
,编写一个函数将所有0移动到数组的末尾,同时保持非零元素的相对顺序
输入: [0,1,0,3,12]
输出: [1,3,12,0,0]
我一开始的想法也是设置快慢指针,但是又毫无意外地陷入了死循环,代码如下
class Solution:
def moveZeroes(self, nums: List[int]) -> None:
"""
Do not return anything, modify nums in-place instead.
"""
if len(nums)<=0: return []
start,end=0,1
flag=True
while(end<len(nums)-1):
print(nums[start])
if nums[start]==0 and nums[end]==0:
# nums[start],nums[end]=nums[end],nums[start]
# start=end
# end+=1
print('...2')
elif nums[start]==0:
nums[start],nums[end]=nums[end],nums[start]
end+=1
start+=1
print('...1')
elif nums[end]==0:
nums[start],nums[end]=nums[end],nums[start]
end+=1
start+=1
else:
return nums
return nums
究其根本就是我的快慢指针设置错了,应该是将他们都设置成start,end=0,0
最后看了答案,思路就是
设置两个快慢指针,
- 如果慢指针为0,快指针不为0,二者交换,快慢指针都后移
- 如果慢指针为0,快指针为0, 快指针后移,腾出快指针位置来运送慢指针的0元素
- 如果慢指针不为0,快慢指针都往后移动,相当于慢指针负责遍历前进的动力,快指针负责辨认方位以及搬运0元素
然后我根据以上思路再写
class Solution:
def moveZeroes(self, nums: List[int]) -> None:
"""
Do not return anything, modify nums in-place instead.
"""
slower,faster=0,0
while faster<len(nums):
if nums[slower]!=0:
slower+=1
faster+=1
elif nums[slower]==0 and nums[faster]!=0:
nums[slower],nums[faster]=nums[faster],nums[slower]
slower+=1
faster+=1
elif nums[slower]==0 and nums[faster]==0:
faster+=1
else:
return nums
通过了
然后比对正确答案,发现,比人写的更加简明意赅
class Solution:
def moveZeroes(self, nums: List[int]) -> None:
"""
Do not return anything, modify nums in-place instead.
"""
slower, faster = 0, 0 #快指针指向不为零的元素,慢指针指向零元素,满足条件就交换
while faster < len(nums):
if nums[slower] != 0:
slower += 1
elif nums[faster] != 0:
nums[slower], nums[faster] = nums[faster], nums[slower]
slower += 1
faster += 1
他相当于慢不为0,慢指针后移动,然后快指针后移;快不为0,二者交换,慢指针后移动,然后快指针后移。
测试用例
def moveZeroes(nums):
"""
Do not return anything, modify nums in-place instead.
"""
slower,faster=0,0
while faster<len(nums):
if nums[slower]!=0:
slower+=1
if nums[faster]!=0:
nums[slower],nums[faster]=nums[faster],nums[slower]
slower+=1
faster+=1
return nums
nums=[0,1,0,3,12]
print(moveZeroes(nums))