LeetCode题解第二章线性表2.1.1~2.1.2

2.1.1 Remove Duplicates from Sorted Array
描述
Given a sorted array, 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 in place with constant memory.
For example, Given input array A = [1,1,2],
Your function should return length = 2, and A is now [1,2].

代码如下：

public static int solution2_1_1(int[] array,int n){
		int j=1,k=1;
		while(j<n){
			//注意这里应该是a[j]!=a[k-1]而非a[j]!=a[j-1]
			//对于这道题目，后一种写法照样可以得出正确答案；但是考虑下一题就会发现，前一种写法明显更加普适
			if(array[j]!=array[k-1])
				array[k++]=array[j];
			j++;
			
		}
		for(int i=0;i<=k-1;i++){
			System.out.print(array[i]+" ");
		}
		return k;
	}

2.1.2 Remove Duplicates from Sorted Array II
描述
Follow up for ”Remove Duplicates”: What if duplicates are allowed at most twice?
For example, Given sorted array A = [1,1,1,2,2,3],
Your function should return length = 5, and A is now [1,1,2,2,3]

代码如下:

public static int solution2_1_2(int[] array,int n){
		int j=2,k=2;
		while(j<n){
			if(array[j]!=array[k-2])
				array[k++]=array[j];
			j++;
		}
		for(int i=0;i<=k-1;i++){
			System.out.print(array[i]+" ");
		}
		return k-1;
	}