leetcode - 3Sum Closest （kSum Closest）

最新推荐文章于 2020-04-09 11:13:08 发布

原创最新推荐文章于 2020-04-09 11:13:08 发布 · 649 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

c++

算法

linux

本文介绍了一个算法问题：给定一个整数数组和一个目标值，找到数组中三个整数相加最接近目标值的组合，并返回这三个数的和。文章提供了具体的实现代码，采用排序和双指针技巧将时间复杂度降低到O(n^2)。

Sum ClosestGiven an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exactly one solution.

    For example, given array S = {-1 2 1 -4}, and target = 1.

    The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).

时间复杂度 O(n^k)

#include 
#include 
#include 
#include 
#include 

using namespace std;

class Solution {
public:
    int threeSumClosest(vector& nums, int target){
                sort(nums.begin(),nums.end());
                return kSumClosestWithSort(nums,0,3,target);
        };

    int kSumClosestWithSort(vector& nums,int start,int k, int target) {

                int len=nums.size();
                int tmp=0;

                if(k==1)
                {
                        if(nums[start]>=target)
                                return nums[start];
                        while(start=target)
                                {
                                        return abs(nums[start]-target) nums;
        nums.push_back(-1);
        nums.push_back(2);
        nums.push_back(1);
        nums.push_back(-4);
        cout<


时间复杂度O(n^k-1)

#include 
#include 
#include 
#include 
#include 

using namespace std;

class Solution {
public:
    int threeSumClosest(vector& nums, int target){
                sort(nums.begin(),nums.end());
                return kSumClosestWithSort(nums,0,3,target);
        };

    int kSumClosestWithSort(vector& nums,int start,int k, int target) {

                int len=nums.size();
                int tmp=0;

                if(k==2)
                {
                        int i=start;
                        int j=len-1;
                        int ret=nums[i]+nums[j];
                        int sum=0;
                        while(i nums;
        nums.push_back(-1);
        nums.push_back(2);
        nums.push_back(1);
        nums.push_back(-4);
        cout<

标签

#leetcode #面试 #算法