|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15 |
class
Solution {public: int
removeDuplicates(int
A[], int
n) { if
(n == 0) return
0; int
*rpos = A, *wpos = A + 1, *end = A + n; int
cur; int
pre = *(rpos++); while
(rpos != end) { cur = *(rpos++); if
(pre == cur) continue; *(wpos++) = pre = cur; } return
n - (rpos - wpos); }}; |
水一发
LeetCode Remove Duplicates from Sorted Array,布布扣,bubuko.com
LeetCode Remove Duplicates from Sorted Array
原文：http://www.cnblogs.com/lailailai/p/3624608.html