【Hot100】LeetCode—283. 移动零

---

• 原题链接：283. 移动零

---

1- 思路

双指针法

• 1- 定义快慢指针
  • slow 指针用于记录非 0 下标位置
  • fast 指针用于遍历数组
• 2- 实现思路
  • 遇到 nums[fast]!=0时，更新 nums[slow++] = nums[fast]
• 3- 最终处理0
  • int n = fast - slow;
  • 遍历 n 个数字，填充 0

---

2- 实现

283. 移动零⭐——题解思路

class Solution {
    public void moveZeroes(int[] nums) {
        int slow = 0;
        int fast = 0;
        for(;fast<nums.length;fast++){
            if(nums[fast]!=0){
                nums[slow++] = nums[fast];
            }
        }

        int n = fast - slow;
        for(int i = 0;i<n;i++){
            nums[slow++] = 0;
        }
    
    }
}

---

3- ACM 实现

public class moveZero {


    public static void moveZ(int[] nums){
        int slow = 0;
        int fast = 0;
        for(;fast<nums.length;fast++){
            if(nums[fast]!=0){
                nums[slow++] = nums[fast];
            }
        }

        int n = fast - slow;
        for(int i = 0 ; i < n;i++){
            nums[slow++] = 0;
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        System.out.println("输入数组长度");
        int n = sc.nextInt();
        int[] nums = new int[n];
        for(int i = 0 ; i < n ;i++){
            nums[i] = sc.nextInt();
        }
        moveZ(nums);
        System.out.println("结果是");
        for(int i : nums){
            System.out.print(i+" ");
        }
    }
}

---