[LeetCode]283. Move Zeroes

最新推荐文章于 2024-09-01 11:29:54 发布

炼丹师

最新推荐文章于 2024-09-01 11:29:54 发布

阅读量228

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/py184473894/article/details/70477567

版权

LeetCode 专栏收录该内容

34 篇文章 0 订阅

订阅专栏

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.

思路：从头到尾遍历，如果不为0，则移到index位后index加一，index从0开始，这样经过一遍遍历之后index之前的就全都是非零元素了

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