Leetcode 题目解析之 Move Zeroes

2022-01-09 11:40:04 浏览数 (1)

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:

  1. You must do this in-place without making a copy of the array.
  2. Minimize the total number of operations.
代码语言:txt复制
    public void moveZeroes(int[] nums) {
        int t = 0;
        // 把非0元素移到前面
        for (int i = 0; i < nums.length; i  ) {
            if (nums[i] != 0) {
                nums[t  ] = nums[i];
            }
        }
        // 把后面元素值0
        for (int i = t; i < nums.length; i  ) {
            nums[i] = 0;
        }
    }

0 人点赞