LeetCode26

至此，第一部分，双指针结束。

该题对应双指针最后两题之一，无额外空间的就地替换。

C++ 方法：

 #include
 #include

 using namespace std;
 int removeDuplicates(vector<int>& nums){
     int len = nums.size();
     if (0 == len) return 0;
     if (1 == len) return 1;
     vector<int>::iterator iter1 = nums.begin();
     vector<int>::iterator iter2 = iter1;
     vector<int>::iterator iterEnd = nums.end();
     iter2++;

     while (iterEnd != iter2)
     {
         if (*iter1 == *iter2)
         {
             iter2++;
             len--;
         }
         else
         {
             iter1++;
             swap(*iter1, *iter2);
             iter2++;
         }
     }
     return len;
 }

 void showVector(const vector<int>& nums){
     for each (int i in nums)
     {
         cout << i << " ";
     }
     cout << endl;
 }

 int main()
 {
     vector<int> nums;
     nums.push_back(2);
     nums.push_back(1);
     nums.push_back(3);
     nums.push_back(0);
     nums.push_back(1);
     nums.push_back(1);
     nums.push_back(0);
     nums.push_back(3);
     nums.push_back(3);
     nums.push_back(1);
     nums.push_back(3);

     cout << removeDuplicates(nums);

     return 1;
 }