首页 > 代码库 > LeetCode-3Sum Smaller
LeetCode-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:
[-2, 0, 1][-2, 0, 3]
Follow up:
Could you solve it in O(n2) runtime?
Solution:
public class Solution { public int threeSumSmaller(int[] nums, int target) { if (nums.length<3) return 0; Arrays.sort(nums); int count = 0; for (int p1=0;p1<nums.length-2;p1++){ // Early termination if (nums[p1]+nums[p1+1]+nums[p1+2]>=target) break; int p2=p1+1, p3=nums.length-1; while (p2<p3){ while (p2<p3 && nums[p2]+nums[p3]>=target-nums[p1]){ p3--; } count += p3-p2; p2++; } } return count; }}
LeetCode-3Sum Smaller
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。