Leetcode_26: removeDuplicates

 1 class Solution {
 2 public:
 3     int removeDuplicates(vector<int>& nums) {
 4         if(nums.size() < 2){
 5             return nums.size();
 6         }
 7         int cur = nums[0];
 8         int k = 1;
 9         for(int i = 1; i < nums.size(); i++){
10             if(nums[i] != cur){
11                 cur = nums[i];
12                 nums[k++] = nums[i];
13             }
14         }
15         return k;
16     }
17 };
【推广】 免费学中医，健康全家人
原文地址：https://www.cnblogs.com/fengcnblogs/p/13508989.html