LeetCode259 三数之和较小值

题目描述

Given an array of n integers nums and a target, find the number of index triplets i, j, k with 0 <= i < j < k < n that satisfy the condition nums[i] + nums[j] + nums[k] < target.

Example:

Input: nums =
[-2,0,1,3]
, and target = 2
Output: 2
Explanation: Because there are two triplets which sums are less than 2:
[-2,0,1]
[-2,0,3]
Follow up: Could you solve it in O(n2) runtime?
给出数组nums和目标值target，找出数组中的所有三数之和小于target的三元组，并返回其个数。要求时间复杂度在 O(n2) 以内

解题思路

特殊判断。
排序。
采用双指针，比较nums[i]、nums[left]、nums[right]三数之和和target的值，小于target则计数器count加一。

示例代码

public class Solution {
    public int threeSumSmaller(int[] nums, int target) {
        if(nums == null || nums.length == 0){
            return 0;
        }
        
        Arrays.sort(nums);
        
        int count = 0;
        
        for(int i = 0; i<nums.length-2; i++){
            int j = i+1;
            int k = nums.length-1;
            while(right > left) {
                if(nums[i] + nums[left] + nums[right] >= target){
                    right--;
                }else{
                   count += k-j;//只要右指针指向的数字满足，左右指针之间的数字都满足
                   left++;
                }
            }
        }
        return count;
    }
}