leetcode-26

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.

输入范例

Given input array nums = [1,1,2],

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

解题思路

是有序数组，所以当第i个元素和第i-1个元素相等的时候第i个元素一定是重复元素，采用两个游标，一个在左边，代表不重复的数组，一个在右边，代表原数组，当有不重复元素的时候，将这个元素赋值到不重复数组的顶部，并将左游标右移一位

JAVA代码：

public class Solution {    public int removeDuplicates(int[] nums) {        int count = 0;        for(int i = 0; i<nums.length; i++){            if(i==0 || nums[i] != nums[i-1]){                nums[count++] = nums[i];            }        }        return count;    }}

原题地址