Remove Duplicates from Sorted List

原题链接在这里：https://leetcode.com/problems/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.

题解：

利用counter来更改新array前面的元素.

Time Complexity: O(n). Space: O(1).

AC Java:

 1 public class Solution {
 2     public int removeDuplicates(int[] nums) {
 3         if(nums == null || nums.length == 0){
 4             return 0;
 5         }
 6         
 7         int count = 1;
 8         for(int i = 1; i<nums.length; i++){
 9             if(nums[i] != nums[i-1]){
10                 nums[count++] = nums[i];
11             }
12         }
13         return count;
14     }
15 }

跟上Remove Duplicates from Sorted Array II.

类似Remove Duplicates from Sorted List.

来源：https://www.cnblogs.com/Dylan-Java-NYC/p/4825002.html