[LeetCode]--26. 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.

最开始我没看清楚题目，想着return新的长度就行，想着用空间换取时间，写的算法是

public int removeDuplicates(int[] nums) {
        if (nums.length ==