leetcode hot 08

合集 - leetcode hot100(25)

1.leetcode hot 0102-152.leetcode hot 0202-153.leetcode hot 0402-164.leetcode hot 0302-155.leetcode hot 0502-176.leetcode hot 0602-197.leetcode hot 0702-20

8.leetcode hot 0802-21

9.leetcode hot 0902-2110.leetcode hot 1002-2411.leetcode hot 1202-2512.leetcode hot 1302-2613.leetcode hot 1402-2814.leetcode hot 1503-0115.leetcode hot 1103-0316.leetcode hot 1603-0317.leetcode hot 1703-0318.leetcode hot 1803-0319.leetcode hot 1903-0420.leetcode hot 2003-0521.leetcode hot 2103-0522.leetcode hot 2203-1223.leetcode hot 2303-1224.leetcode hot 2403-1225.leetcode hot 2503-12

收起

解题思路：双指针问题，一个思路就是一个指针负责保留要的数组元素，另一个负责一直往前筛选，碰到0就跳过，剩下的就保存在第一个指针中，最后再把剩下的部分用0补齐。

class Solution {
    public void moveZeroes(int[] nums) {
        int left = 0;
        int right = 0;
        while(right<nums.length){
            while(right<nums.length-1&&nums[right]==0) right++;
            nums[left] = nums[right];
            left++;
            right++;
        }
        while(left<nums.length){
            nums[left]=0;
            left++;
        }
        return ;
    }
}