283. Move Zeroes

Given an integer arraynums, move all0's to the end of it while maintaining the relative order of the non-zero elements.

Notethat you must do this in-place without making a copy of the array.

Example 1:

Input: nums = [0,1,0,3,12] Output: [1,3,12,0,0]

Example 2:

Input: nums = [0] Output: [0]

Constraints:

• 1 <= nums.length <= 104
• -231<= nums[i] <= 231- 1

 

풀이방법

- swap을 이용한 방법으로 풀이

 

class Solution {
    public void moveZeroes(int[] nums) {
        int j = 0;
        for( int i=0; i < nums.length; i++ ) {
            if( nums[i] != 0 ) {
                // if i position is not 0, swap i and j number.
                swap( nums, i, j);
                j++;
            }
        }
    }
    
    private static void swap( int nums[], int i, int j) {
        int temp = nums[j];
        nums[j] = nums[i];
        nums[i] = temp;
    }
}