LeetCode OJ：Remove Duplicates from Sorted Array（排好序的vector去重）

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.

简单的双指针题目，没什么好说的：

 1 class Solution {
 2 public:
 3     int removeDuplicates(vector<int>& nums) {
 4         int sz = nums.size();
 5         if(sz == 0 || size == 1) return sz;
 6         int j = 1;
 7         for(int i = 1; i < sz; ++i){
 8             if(nums[i] != nums[i-1])
 9                 nums[j++] = nums[i];
10         }
11         return j;
12     }
13 };

LeetCode OJ：Remove Duplicates from Sorted Array（排好序的vector去重）

原文：http://www.cnblogs.com/-wang-cheng/p/4878880.html