【Leetcode】4Sum (Sum)
来源:互联网 发布:荣耀盒子 软件安装 编辑:程序博客网 时间:2024/05/16 21:44
Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target.
Note:
- Elements in a quadruplet (a,b,c,d) must be in non-descending order. (ie, a ≤ b ≤ c ≤ d)
- The solution set must not contain duplicate quadruplets.
For example, given array S = {1 0 -1 0 -2 2}, and target = 0. A solution set is: (-1, 0, 0, 1) (-2, -1, 1, 2) (-2, 0, 0, 2)这道题就是将4sum转化为3sum再转化为2sum进行求解,理解透转化的过程是这道题求解最重要的部分
直接上代码 来自Code_Ganker
public ArrayList<ArrayList<Integer>> fourSum(int[] num, int target) {ArrayList<ArrayList<Integer>> result = new ArrayList<ArrayList<Integer>>();if (num == null || num.length < 4)return result;Arrays.sort(num);for (int i = num.length - 1; i > 2; i--) {if (i == num.length - 1 || num[i] != num[i + 1]) {ArrayList<ArrayList<Integer>> curRes = threeSum(num, i - 1,target - num[i]);for (int j = 0; j < curRes.size(); j++) {curRes.get(j).add(num[i]);}result.addAll(curRes);}}return result;}public ArrayList<ArrayList<Integer>> threeSum(int[] num, int end, int target) {ArrayList<ArrayList<Integer>> result = new ArrayList<ArrayList<Integer>>();for (int i = end; i > 1; i--) {if (i == end || num[i] != num[i + 1]) {ArrayList<ArrayList<Integer>> curRes = twoSum(num, i - 1,target - num[i]);for (int j = 0; j < curRes.size(); j++) {curRes.get(j).add(num[i]);}result.addAll(curRes);}}return result;}public ArrayList<ArrayList<Integer>> twoSum(int[] num, int end, int target) {ArrayList<ArrayList<Integer>> result = new ArrayList<ArrayList<Integer>>();int left = 0;int right = end;while (left < right) {if (num[left] + num[right] == target) {ArrayList<Integer> temp = new ArrayList<Integer>();temp.add(num[left]);temp.add(num[right]);result.add(temp);left++;right--;while (left < right && num[left] == num[left - 1])left++;while (left < right && num[right] == num[right + 1])right--;} else if (num[left] + num[right] > target)right--;elseleft++;}return result;}
0 0
- 【Leetcode】4Sum (Sum)
- leetcode 2 sum 3sum 4sum
- Leetcode 2SUM-3SUM-4SUM
- Leetcode-2sum,3sum,4sum
- leetcode 2 sum & 3 sum & 4 sum
- [LeetCode] 2Sum, 3Sum, 4Sum, 3SUm closet
- [LeetCode] K sum(2Sum、3Sum、4Sum)
- leetcode--sum集合:2sum,3sum,4sum
- leetcode --- 2 sum , 3 sum , 4 sum , k sum problem
- LeetCode: 4 Sum
- LeetCode: 4Sum
- LeetCode 4Sum
- Leetcode: 4SUM
- 【leetcode】 4 sum
- LeetCode 4Sum
- leetcode 44: 4Sum
- [Leetcode] 4 Sum [Unsolved]
- 【leetcode】4Sum
- 大数据实时计算工程师/Storm工程师职业学习路线图
- uva10192-Vacation
- rpath添加依赖库搜索路径
- SQL Server 致程序员(容易忽略的错误)
- JQuery/Javascript两个控件的focus和blur事件
- 【Leetcode】4Sum (Sum)
- java Pattern和Matcher详解
- uva-147 - Dollars
- Android电源管理
- jquery验证
- TCP/IP协议与Socket通信
- 一道职业能力测试题: 数正方形的个数
- 模板方法模式
- Arduino的详细介绍(基于Mega2560)(分文)——PWM的analogWrite()