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 by modifying the input array in-place with O(1) extra memory.

Example:

Given 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.

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

解题思路：

首先检验数组的长度，是否是空；

定义一个数值j，用来计数数组中不一样的数的个数

将数组里面第一个数据作为基准，数组里面的数据跟第一个数据进行比较，如果大于第一个数据，说明两个数据不一样，用该数据替换第一个数据作为比较的基准，并更新计数的数值j

for循环至最后一个数据

输出j

---