leetCode练习（26）

题目：Remove Duplicates from Sorted Array

难度：easy

问题描述：

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 nums = [1,1,2],

Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively. It doesn't matter what you leave beyond the new length.

解题思路：

很简单的一道题，注意要求不能使用额外空间，并且使nums的所有的不同值排在最前面。对于nums={1，1，2，3，3，4，5} ，要求返回5，并且nums的前5位分别为不重复的值。

代码如下：

public class Solution {
    public int removeDuplicates(int[] nums) {
        if(nums==null)		return 0;
        int res=0;
        int[]p=nums;
        for(int i=1;i<nums.length;i++){
        	if(p[i]==nums[res]){
        		
        	}else{
        		nums[++res]=p[i];
        	}
        }
        return res+1;
    }
}