描述

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 A = [1,1,2], Your function should return length = 2, and A is now [1,2]. 

分析 无 

代码 1 

<pre>

 // LeetCode, Remove Duplicates from Sorted Array 

// 时间复杂度 O(n),空间复杂度 O(1) 

class Solution { 

public: 

 int removeDuplicates(int A[], int n) { 

          if (n == 0) return 0; 

          int index = 0; 

           for (int i = 1; i < n; i++) 

                  if (A[index] != A[i]) 

                          A[++index] = A[i];  

          return index + 1; 

 } 

 };

</pre>