# 给定一个数组 nums,编写一个函数将所有 0 移动到数组的末尾,同时保持非零元素的相对顺序。
#
# 请注意 ,必须在不复制数组的情况下原地对数组进行操作。
# class Solution(object):
# def moveZeroes(self, nums):
# """
# :type nums: List[int]
# :rtype: None Do not return anything, modify nums in-place instead.
# """
# pf = 0
# ps = 0
# for i in range(len(nums)):
# if nums[ps] == 0:
# while nums[pf] == 0:
# pf += 1
# if pf == len(nums):
# return nums
# break
# nums[ps] = nums[pf]
# nums[pf] = 0
# ps += 1
# pf = ps
#
# return nums
class Solution(object):
def moveZeroes(self, nums):
"""
:type nums: List[int]
:rtype: None Do not return anything, modify nums in-place instead.
"""
ps = 0
for pf in range(len(nums)):
if nums[pf] != 0:
nums[ps], nums[pf] = nums[pf], nums[ps]
ps += 1
return nums
if __name__ == '__main__':
# nums = [0,1,0,3,13]
nums = [1,0]
Solution = Solution()
print(len(nums))
print(Solution.moveZeroes(nums))