【leetcode】80.（Medium）Remove Duplicates from Sorted Array II

解题思路：
指针

提交代码：

class Solution {
	public int removeDuplicates(int[] nums) {
		if (nums.length == 0)
			return 0;

		int p1 = 0, p2 = 0, p3 = 0,tmp=nums[p1];
		while (p3 < nums.length) {
			nums[p1]=nums[p3];tmp=nums[p1];
			while (p3 + 1 < nums.length && nums[p3 + 1] == tmp)
				p3++;

			if (p3 - p2 >= 1)
				nums[p1 + 1] = nums[p1++];
			p3++;p2=p3;p1++;
		}
		return p1;
	}
}

运行结果：