首页 > 代码库 > leetcode : 3 sum
leetcode : 3 sum
Given an array S of n integers, are there elements a, b, c in S 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.
For example, given array S = [-1, 0, 1, 2, -1, -4], A solution set is: [ [-1, 0, 1], [-1, -1, 2] ]
tag : two pointers
public class Solution {
public List<List<Integer>> threeSum(int[] nums) {
List<List<Integer>> result = new ArrayList<List<Integer>>();
if(nums == null || nums.length < 3){
return result;
}
Arrays.sort(nums);
for(int i = 0 ; i < nums.length - 2; i++){
int a = nums[i];
if(i != 0 && nums[i-1] == nums[i]){
continue;
}
int left = i + 1;
int right = nums.length - 1;
while(left < right){
int b = nums[left];
int c = nums[right];
int sum = a + b + c;
if(sum == 0){
List<Integer> tmp = new ArrayList<Integer>();
tmp.add(a);
tmp.add(b);
tmp.add(c);
result.add(tmp);
left++;
right--;
while(left < right && nums[left] == nums[left-1]){
left ++;
}
while(left < right && nums[right + 1] == nums[right]){
right --;
}
}else if(a + b + c < 0){
left ++;
}else{
right --;
}
}
}
return result;
}
}
leetcode : 3 sum
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。