[LintCode] Move Zeroes
Problem
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.
Notice
You must do this in-place without making a copy of the array.
Minimize the total number of operations.
Example
Given nums = [0, 1, 0, 3, 12], after calling your function, nums should be [1, 3, 12, 0, 0].
Solution
public class Solution {
public void moveZeroes(int[] nums) {
int i = 0, j = i+1;
while (j < nums.length) {
if (nums[i] != 0) {
i++;
j++;
}
else {
if (nums[j] == 0) j++;
else {
swap(nums, i, j);
i++;
}
}
}
}
public void swap(int[] nums, int i, int j) {
int temp = nums[i];
nums[i] = nums[j];
nums[j] = temp;
}
}
关键字:java, nums, int, the
本文来自互联网用户投稿,文章观点仅代表作者本人,不代表本站立场,不承担相关法律责任。如若转载,请注明出处。 如若内容造成侵权/违法违规/事实不符,请点击【内容举报】进行投诉反馈!