Leetcode15:三数求和
题目描述
思路分析
确定数组中的每一个元素,通过双指针判断后面的数组中是否有两个数的和等于0-nums[i];
代码实现
package LeetCode;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
/*
* 给定数组 nums = [-1, 0, 1, 2, -1, -4],
满足要求的三元组集合为:
[
[-1, 0, 1],
[-1, -1, 2]
]
*/
public class ThreeSum
{
public static void main(String[] args)
{
int[]nums= {-1,0,1,2,-1,-4};
System.out.println(threeSum(nums));
}
public static List<List<Integer>> threeSum(int[] nums)
{
List<List<Integer>> res=new ArrayList<>();
Arrays.sort(nums);
for (int i = 0; i < nums.length-2; i++)
{ //规定nums.length-2表示i指向倒数第三个元素,这是确定了倒数第三个,后面两个数进行相加
if (i>0&&nums[i]==nums[i-1]) continue;//去重1,i是从前往后,所以与i-1比较。
int low=i+1,high=nums.length-1,sum=0-nums[i];
while (low<high)
{
if (nums[low]+nums[high]==sum)
{
//Arrays.asList()将数组转化为list
res.add(Arrays.asList(nums[i],nums[low],nums[high]));
while (low<high&&nums[low]==nums[low+1])low++;//去重2,low是从前往后,所以与low+1比较
while (low<high&&nums[high]==nums[high-1]) high--;//去重3,high是从后往前,所以与high-1比较
low++;
high--;
}else if (nums[low]+nums[high]<sum) {
low++;
}else {
high--;
}
}
}
return res;
}
}
知识补充
Arrays.asList()方法将数组转化为list