leetcode--Remove Duplicates from Sorted Array

Given a sorted array, remove the duplicates in place such that each element appear onlyonce 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 ofnums being 

1

 and 

2

 respectively. It doesn't matter what you leave beyond the new length.

题意：给定一个排序数组，移除重复元素，返回新数组的长度。

分类：数组，双指针

解法1：双指针，一个用于遍历，一个用于指向当前覆盖位置。

[java] view
plain copy

public class Solution {  

    public int removeDuplicates(int[] nums) {  

        if(nums.length==0) return 0;  

        int pre = nums[0];  

        int count = 1;  

        for(int i=1;i<nums.length;i++){  

            if(pre!=nums[i]){                 

                pre = nums[i];  

                nums[count] = nums[i];  

                count++;  

            }  

        }  

        return count;  

    }  

}  

原文链接http://blog.csdn.net/crazy__chen/article/details/45584177