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 static void moveZeroes(int[] nums) {
for( int i = 1 ; i < nums.length; i++)
{
for( int j = i-1; j >= 0 ; j--)
{
if(nums[j]==0)
{
int tmp = nums[j];
nums[j] = nums[j+1];
nums[j+1] = tmp;
}
}
}
}
画图。明白数字在内存如何移动,即可以思路的清晰写出代码。