当前位置: 代码迷 >> 综合 >> Leetcode Top100:移动0
  详细解决方案

Leetcode Top100:移动0

热度:19   发布时间:2024-02-10 10:25:05.0

class Solution(object):def moveZeroes(self, nums):count=0for i in range(len(nums)):if nums[i]==0:count+=1else:nums[i-count]=nums[i] for j in range(len(nums)-1,len(nums)-count-1,-1):nums[j]=0return nums