摘要:
Given an array nums of n integers and an integer target, are there elements a, b, c, and d in nums such that a + b+ c + d = target? Find all unique qu 阅读全文
摘要:
3Sum Closest Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the s 阅读全文
摘要:
数组中找三个数和为0的结果集 1 // 解法一:先排序 然后固定一个值 然后用求两个数的和的方式 2 public static List> threeSum(int[] nums) { 3 List> res = new ArrayList(); 4 if (nums.length list = new ArrayList(); 18 ... 阅读全文