描述: 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
思路: 跟 “Remove Element” 思路一模一样,只是最后要把后半截设置为0。
示例代码:
// Time Complexity: O(n), Space Complexity: O(1)publicclass Solution {
publicvoidmoveZeroes(int[] nums) {
int index = 0;
for (int i = 0; i < nums.length; ++i) {
if (nums[i] != 0) {
nums[index++] = nums[i];
}
}
for (int i = index; i < nums.length; ++i) {
nums[i] = 0;
}
}
}