LeetCode 283 -Move Zeroes ( JAVA )

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.

public class Solution {
public void moveZeroes(int[] nums) {
int j=0;
for(int i=0;i<nums.length;i++){
if(nums[i]!=0){
nums[j++] = nums[i];
}
}
while(j<nums.length){
nums[j++] = 0;
}
}
}

总结:传递的是引用所以对nums进行修改即可盖面nums的值，题目为，判断不是等于0就给第一个元素赋值，以此类推。