LeetCode #1099. Two Sum Less Than K

原创于 2019-09-25 22:50:00 发布 · 246 阅读

0 ·

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

LeetCode 专栏收录该内容

625 篇文章

订阅专栏

本文介绍了一个算法问题，即在给定整数数组A和整数K的情况下，寻找两个元素的和最大但又小于K的值。通过排序和双指针技巧，文章提供了一种高效的解决方案。

题目描述：

Given an array A of integers and integer K, return the maximum S such that there exists i < j with A[i] + A[j] = S and S < K. If no i, j exist satisfying this equation, return -1.

Example 1:

Input: A = [34,23,1,24,75,33,54,8], K = 60
Output: 58
Explanation: 
We can use 34 and 24 to sum 58 which is less than 60.

Example 2:

Input: A = [10,20,30], K = 15
Output: -1
Explanation: 
In this case it's not possible to get a pair sum less that 15.

Note:

1 <= A.length <= 100
1 <= A[i] <= 1000
1 <= K <= 2000

class Solution {
public:
    int twoSumLessThanK(vector<int>& A, int K) {
        sort(A.begin(),A.end());
        int i=0, j=A.size()-1;
        int result=-1;
        while(i<j)
        {
            if(A[i]+A[j]<K) 
            {
                result=max(result,A[i]+A[j]);
                i++;
            }
            else j--;
        }
        return result;
    }
};