3Sum
Description
Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.
Note:
The solution set must not contain duplicate triplets.
- Example 1
Input: Given array nums = [-1, 0, 1, 2, -1, -4],
Output:
A solution set is:
[
[-1, 0, 1],
[-1, -1, 2]
]
Solution
降重点
- 开始循环时:i=0或者(i>0,且键值不相同)
- 等于号,l右移并且r左移的时候再行键值的判断
- 小于号,同上
- 大于号,同上
防止溢出
在内部时时判断l是否小于r
class Solution {
public List<List<Integer>> threeSum(int[] nums) {
Arrays.sort(nums);
List<List<Integer>> ls = new LinkedList<>();
int len=nums.length;
for(int i=0;i<len;i++){
if(i==0||(i>0 &&nums[i]!=nums[i-1])){
int l=i+1,r=len-1;int sum=0-nums[i];
while(l<r){
if (nums[l]+nums[r]==sum){
ls.add(Arrays.asList(nums[i],nums[l],nums[r]));
while(l<r&&nums[l+1]==nums[l])l++;
while(l<r&&nums[r-1]==nums[r])r--;
l++;r--;
}
else if(nums[l]+nums[r]<sum){
while(l<r&&nums[l+1]==nums[l])l++;
l++;
}
else{while(l<r&&nums[r-1]==nums[r])r--;
r--;
}
}
}
}
return ls;
}
}
Appendix
1.Arrays.asList(nums[i],nums[l],nums[r])