[Leetcode] 3Sum

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:

• 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 {
    public List<List<Integer>> threeSum(int[] nums) {
        Arrays.sort(nums);
        List<List<Integer>> result = new ArrayList<>();
        for(int i = 0; i <= nums.length - 3; i++){
            if(!(i == 0 || nums[i-1] < nums[i])) continue;
            int target = -nums[i];
            int start = i + 1;
            int end = nums.length - 1;
            while(start < end){
                boolean startChange = false;
                boolean endChange = false;
                int sum = nums[start] + nums[end];
                if(sum == target){
                    result.add(new ArrayList<Integer>(Arrays.asList(new Integer[] {nums[i], nums[start], nums[end]})));
                    startChange = true;
                    endChange = true;
                }
                else if(sum < target){
                    startChange = true;
                }
                else{
                    endChange = true;
                }
                
                if(startChange){
                    while(start < end && nums[start] == nums[start+1]) start++;
                    start++;
                }
            
                if(endChange){
                    while(start < end && nums[end] == nums[end-1]) end--;
                    end--;
                }
            }
        }
        return result;
    }
}

思路参照：http://www.programcreek.com/2012/12/leetcode-3sum/

自己没有想到好的解法，原po利用sorting解决了duplicate code和选择的问题