[LeetCode] NO. 283 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.
[题目解析] 根据题意,所有0元素放到最后,非0元素依次前移。遍历数组,根据遍历顺序依次将非0元素装入新数组,然后后边的元素全部设为0即可。如下。
public void moveZeroes(int[] nums) { int j = 0; for(int num : nums){ if(0 != num){ nums[j++] = num; } } while(j < nums.length){ nums[j++] = 0; } }