(java)Remove Duplicates from Sorted Array

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.

思路:本题题意就是移除数组中重复的数，本题的关键是不仅要计算不重复元素的个数，还要保持删除重复元素后，不同元素的顺序不变。

统计第p个位置的元素之前重复元素的个数假设为n，则第p个元素应该在p-n的位置。

代码如下(已通过leetcode)

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