【LeetCode 26】删除有序数组中的重复项

比较简单。

    public static int removeDuplicates(int[] nums) {
    	if (nums.length <= 1)
    		return nums.length;
    	int p1 = 0, p2 = 1;
    	int point = 0;
    	while (true)
    	{
    		nums[point] = nums[p1];
        	while (p2 < nums.length && nums[p1] == nums[p2])
        	{
        		p2++;
        	}
        	if (p2 == nums.length)
        		break;
        	p1 = p2;
        	point++;
    	}
    	return point+1;
    }