LeetCode

package LeetCode.contact;

import java.util.Arrays;

public class LeetCode_283 {
	public static void main(String[] args) {
		int[] arr1 = new int[]{1,3,0,1,0};
		Solution_283 sol = new Solution_283();
		sol.moveZeroes(arr1);
		System.out.println(Arrays.toString(arr1));
	}
}
class Solution_283 {
    public void moveZeroes(int[] nums) {
    	int n = nums.length, left = 0, right = 0;
    	while(right < n){		//保证交换在数组范围内
    		if(nums[right] != 0){		//当存在零时，右边+1，左边不动，然后交换左右位置（此时左边为0）。
    			swap(nums, left, right);
    			left++;
    		}
    		right++;
    	}
    }

public void swap(int[] nums, int left, int right){			//交换数组中left和right的位置
	int a = nums[left];
	nums[left] = nums[right];
	nums[right] = a;
	}	
}