本文为senlie原创,转载请保留此地址:http://blog.csdn.net/zhengsenlie
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]
.
相关题目:
Remove Element
Remove Duplicates from Sorted List
Remove Duplicates from Sorted List II
Remove Duplicates from Sorted Array II
Remove Nth Node From End of List
class Solution { public: int removeDuplicates(int A[], int n) { int j = 0; for(int i = 1; i < n; i++){ if(A[i] != A[j]) A[++j] = A[i]; } if(n == 0) return 0; else return j + 1; } };
Leetcode 线性表 Remove Duplicates from Sorted Array,布布扣,bubuko.com
Leetcode 线性表 Remove Duplicates from Sorted Array
原文:http://blog.csdn.net/zhengsenlie/article/details/25775113