leetcode 3Sum(Java)

题目链接：点击打开链接

类型：数学处理

解法：

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);
        int i = 0;
        while (i < nums.length - 2)
        {
        	if (nums[i] > 0) break;
        	int j = i + 1;
        	int k = nums.length - 1;
        	while (j < k)
        	{
        		int sum = nums[i] + nums[j] + nums[k];
        		if (sum == 0) result.add(Arrays.asList(nums[i], nums[j], nums[k]));
        		if (sum <= 0) while(nums[j] == nums[++j] && j < k);
        		if (sum >= 0) while(nums[k--] == nums[k] && j < k);
        	}
        	while (nums[i] == nums[++i] && i < nums.length - 2);
        }
        return result;
    }
}