Leetcode Everyday: 283. Move Zeroes

原创于 2016-05-12 00:01:36 发布 · 234 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

69 篇文章

订阅专栏

本文介绍了一个利用双指针技术在原地操作数组，将所有非零元素向前移动，同时将零元素移动至数组末尾的方法。该方法不仅简化了操作流程，而且在保持原有非零元素相对顺序的同时，实现了空间复杂度为O(1)的优化。通过实例演示，清晰阐述了解题思路与具体实现步骤。

https://leetcode.com/problems/move-zeroes/

Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.

For example, given nums = [0, 1, 0, 3, 12], after calling your function, nums should be [1, 3, 12, 0, 0].

Note:

You must do this in-place without making a copy of the array.
Minimize the total number of operations.

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

use two pointers, move the integer to where the should be, and fill the rest of the array with 0s.