# [LeetCode] 3Sum

109人阅读 评论(0)

Given an array S of n integers, are there elements abc in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.

Note:

• Elements in a triplet (a,b,c) must be in non-descending order. (ie, a ≤ b ≤ c)
• 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)

public class Solution {
List<List<Integer>> ret = new ArrayList<List<Integer>>();

public List<List<Integer>> threeSum(int[] nums) {
if (nums == null || nums.length < 3)
return ret;
Arrays.sort(nums);

int len = nums.length;
for (int i = 0; i < len - 2; i++) {
//exclude duplicates
if (i > 0 && nums[i] == nums[i-1])
continue;
twoSum(nums, i + 1, len - 1, 0 - nums[i]);
}
return ret;
}

public void twoSum(int[] nums, int l, int r, int target) {
while (l < r) {
if (nums[l] + nums[r] == target) {
List<Integer> ans = new ArrayList<Integer>();

while (l < r && nums[l] == nums[l+1])
l++;
while (l < r && nums[r] == nums[r-1])
r--;
l++;
r--;
} else if (nums[l] + nums[r] < target)
l++;
else
r--;
}
}
}


0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：3584次
• 积分：310
• 等级：
• 排名：千里之外
• 原创：29篇
• 转载：0篇
• 译文：0篇
• 评论：0条
文章分类
文章存档