# LeetCode 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:

1. You must do this in-place without making a copy of the array.
2. Minimize the total number of operations.

class Solution {
public void moveZeroes(int[] nums) {

for(int i =0, j=0; j<=nums.length; j++) {
if(nums[j] == 0) {

continue;
} else {
nums[i] = nums[j];
i++;
nums[j] = 0;
}
}
}
}

Run Code Status: Runtime Error
Run Code Result:

[0,1,0,3,12]

Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: 5
at Solution.moveZeroes(Solution.java:5)
at __DriverSolution__.__helper__(__Driver__.java:8)
at __Driver__.main(__Driver__.java:52)

class Solution {
public void moveZeroes(int[] nums) {

for(int i =0, j=0; j<nums.length; j++) {
if(nums[j] == 0) {

continue;
} else {
nums[i] = nums[j];
i++;
nums[j] = 0;
}
}
}
}

Submission Result: Wrong Answer

Input: [1]
Output: [0]

Expected: [1]

还是不能直接赋值0.

class Solution {
public void moveZeroes(int[] nums) {

int temp;
for(int i =0, j=0; j<nums.length; j++) {
if(nums[j] == 0) {

continue;
} else {

temp = nums[i];
nums[i] = nums[j];
i++;
nums[j] = temp;
}
}

}
}

posted @ 2018-04-18 10:13  Zhao_Gang  阅读(92)  评论(0编辑  收藏  举报