Leetcode-Question-259: 3Sum Smaller

原文链接:

https://leetcode.com/problems/3sum-smaller/

题目描述:

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.

For example, given nums = [-2, 0, 1, 3], and target = 2.

Return 2. Because there are two triplets which sums are less than 2:

Follow up:
Could you solve it in O(n^2) runtime?

解析:

 

发表评论

电子邮件地址不会被公开。 必填项已用*标注