C++刷题笔记

1，数组去重

//STL 
iterator unique (iterator first, iterator last)
{
  if (first==last) return last;
 
  iterator result = first;
  while (++first != last)
  {
    if (!(*result == *first)) 
      *(++result)=*first;
  }
  return ++result;
}*result 返回迭代器的引用

 int removeDuplicates(vector<int>& nums) {
          if (nums.empty()) return 0;
          int index = 0;
          for (int i = 1; i < nums.size(); i++) {
              if (nums[index] != nums[i])
                  nums[++index] = nums[i];
}
          return index + 1;
      }