leetcode-26. Remove Duplicates from Sorted Array

Easy!
https://leetcode.com/problems/remove-duplicates-from-sorted-array/#/description

去除有序表中重复的元素

问题描述：
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.

解题思路：
设立一个指针i，用来记录非重复的位置，循环原顺序表中的元素，如果相同则后移，将下一个非重复的元素，放入到++i的位置上。

代码如下：

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