class Solution:
def moveZeroes(self, nums: List[int]) -> None:
n=len(nums)
for i in range(n):
if nums[i]==0:
j=i+1
while j<=n-1:
if nums[j]!=0:
nums[i]=nums[j]
nums[j]=0
break
j+=1
复杂度太高了,O(n*n)了
class Solution:
def moveZeroes(self, nums: List[int]) -> None:
j=0
n = len(nums)
for i in range(n):
if nums[i]!=0:
nums[j]=nums[i]
j+=1
for i in range(j,n):
nums[i]=0
O(n)