Move Zeroes——Two Pointers
程序员文章站
2024-02-29 09:41:34
...
Given an array nums
, write a function to move all 0
's to the end of it while maintaining the relative order of the non-zero elements.
For example, given nums = [0, 1, 0, 3, 12]
, after calling your function, nums
should be [1, 3, 12, 0, 0]
.
Note:
- You must do this in-place without making a copy of the array.
- Minimize the total number of operations.
class Solution(object):
def moveZeroes(self, nums):
"""
:type nums: List[int]
:rtype: void Do not return anything, modify nums in-place instead.
"""
start, end = 0, 0
while end < len(nums) and start < len(nums):
while start < len(nums) and nums[start] != 0:
start += 1
end = start + 1
while end < len(nums) and nums[end] == 0:
end += 1
if end < len(nums) and start < len(nums):
nums[start] = nums[end]
nums[end] = 0
推荐阅读
-
two pointers 双针法
-
Move Zeroes——Two Pointers
-
two pointers
-
2021暑假Leetcode刷题——Two Pointers(2)
-
LeetCode C++ 454. 4Sum II【Hash Table/Sort/Two Pointers/Binary Search】
-
codeforces 1260 B. Obtain Two Zeroes
-
LeetCode-283. Move Zeroes(移动零)(简单题)(三种写法)
-
Codeforces Round #561 (Div. 2):C - A Tale of Two Lands(two pointers)
-
two pointers
-
two pointers