本文主要是介绍Leetcode || 4Sum,希望对大家解决编程问题提供一定的参考价值,需要的开发者们随着小编来一起学习吧!
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.
在3Sum基础上改改就行
package pack;import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.List;/** 求三数和为0,遍历一个数,以它为定点,再转化为2Sum*/
class Solution {public List<List<Integer>> fourSum(int[] nums, int target) {Arrays.sort(nums);HashSet hs = new HashSet();
这篇关于Leetcode || 4Sum的文章就介绍到这儿,希望我们推荐的文章对编程师们有所帮助!