Leetcode日常刷码（2）解决数组去重问题（Java）

问题描述：（切记！！！给出的数组必须有序）

Given a sorted array nums, remove the duplicates in-place such that each element appear only once and return the new length.

Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.

Example 1:

Given nums = [1,1,2],

Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively.

问题解决思路：

有两种解决办法

1，利用数组下标和中间变量解决

2，利用快慢指针解决

具体内容请看代码注释

代码实现：

package Algorithm;

import java.lang.reflect.Array;
import java.util.ArrayList;
import java.util.Arrays;

public class Example2 {
	//利用数组下标和临时变量处理数组问题
	public static int GainArreylength1(int[] array){
		if (array == null || array.length == 0){
			return 0;
		}
		if (array.length ==