15.三数之和（数组+排序+双指针）

我的方案：

class Solution {
public:
    vector<vector<int>> threeSum(vector<int>& nums) {
      vector<int> v(3);
      vector<vector<int>> vec;
      if (nums.size()<3) {
        return vec;
      }
      for (int i = 1; i < nums.size(); i++) {
        int value = nums.at(i);
        int j = i - 1;
        for (; j >= 0; j--) {
          if (nums[j] >= value) {
            nums[j+1] = nums[j];
          } else {
            break;
          }
          nums.at(j) = value;
        }
      }
      for (int i = 0; i < nums.size(); i++) {
        if (nums[i] > 0) {
          break;
        }
        if (i > 0 && nums[i] == nums[i-1]) {
          continue;
        }
        int left = i + 1;
        int right = nums.size()-1;
        while (left < right) {
          if (nums[i] + nums[right] + nums[left] == 0) {
            v[0] = nums[i];
            v[1] = nums[right];
            v[2] = nums[left];
            vec.push_back(v);
            while(left < right && nums[left] == nums[left+1])
              left++;
            while(left < right && nums[right] == nums[right-1])
              right--;
            left++;
            right--;
          }
          else if (nums[i] + nums[left] + nums[right] > 0) {
              right--;
          } else {
              left++;
          }
          }
        }
        return vec;
      }
};

之前编译不通过的错误代码

class Solution {
public:
    vector<vector<int>> threeSum(vector<int>& nums) {
      vector<int> v(3);
      vector<vector<int>> vec;
      if (nums.size()<3) {
        return vec;
      }
      for (int i = 1; i < nums.size(); i++) {
        int value = nums.at(i);
        int j = i - 1;
        for (; j >= 0; j--) {
          if (nums[j] >= value) {
            nums[j+1] = nums[j];
          } else {
            break;
          }
          nums.at(j) = value;
        }
      }
      vector<int>::iterator it;
      vector<int>::iterator it_r;
      vector<int>::iterator it_l;

      for (it = nums.begin();it!=nums.end()-2;it++) {
        if (*it > 0) {
          break;
        }
        it_r = it + 1;
        it_l = nums.end()-1;
        while(it_l > it_r) {
          if (*it + *it_l + *it_r > 0) {
            it_l--;
            continue;
          }
          if (*it + *it_l + *it_r < 0) {
            it_r++;
            continue;
          }
          if (*it + *it_l + *it_r == 0) {
            v[0] = *it;
            v[1] = *it_r;
            v[2] = *it_l;
            vec.push_back(v);
            it_l--;
            it_r++;
            while(*it_r == *(it_r-1)) {
              if (it_r-1 == it_l) {
                break;
              }
              it_r++;
            }
            while(*it_l == *(it_l+1)) {
              if (it_l+1 == it_r) {
                break;
              }
              it_l--;
            }
          }
        }
        while (*it == *(it+1) && (it > nums.end()-2)) {
          it++;
        }
      }
      return vec;
    }
};

这个失败的原因是*it和 *(it+1)两者重复的问题，

        while (*it == *(it+1) && (it > nums.end()-2)) {
          it++;
        }

it+1越界和(it > nums.end()-2)错误，所以需要改为

        while ((it < nums.end()-3) && *it == *(it+1)) {
          it++;
        }

总结：利用迭代器时，一定要注意it边界越界问题。