LeetCode刷题笔记----P16 three sum closest

LeetCode刷题笔记----P16 three sum closest

0.问题描述

Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integers. You may assume that each input would have exactly one solution.

1.双指针法

    本题与上一题three sum差不多，采用双指针法，1.三数之和小于sum，j++；2.三数之和大于sum，k–；不断用离target最近的sum更新result

int threeSumClosest(vector<int>& nums, int target) {
        int sum,result=nums[0]+nums[1]+nums[2];
        int j,k;
        sort(nums.begin(),nums.end());
      for(int i=0;i<nums.size();i++){
          j=i+1;
          k=nums.size()-1;
          while(j<k){
              sum=nums[i]+nums[j]+nums[k];
              if(abs(sum-target)<abs(result-target)) result=sum;
              if(sum>target)
                 k--;
              else if(sum<target)
                    j++;
                else 
                   break;
          }    
      }
      return result;
    }