【5_283】Move Zeroes

终于碰到一道水题，睡觉去~

 

Move Zeroes

Total Accepted: 37369 Total Submissions: 88383 Difficulty: Easy

 

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.

 

还有一点，我写代码的时候，用C和C++竟然很不熟悉，不如用Java方便。这说明急需复习！

 

Java：

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