简单题第九题移动零

移动零

双指针法

	public static void moveZeroes(int[] nums) throws Exception {
		int n = nums.length, left = 0, right = 0;
		while (right<n) {
			if (nums[right]!=0) {
				swap(nums, left, right);
				left++;
			}
			right++;
		}
	}
	
	 public static void swap(int[] nums, int left, int right) {
	        int temp = nums[left];
	        nums[left] = nums[right];
	        nums[right] = temp;
	  }

和简单题第八题删除排序数组中的重复项的原理一样