3 Sum

最新推荐文章于 2018-10-17 20:00:26 发布

qiqiqi777

最新推荐文章于 2018-10-17 20:00:26 发布

阅读量394

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/qiqiqi777/article/details/10324417

版权

LeetCode 专栏收录该内容

113 篇文章 0 订阅

订阅专栏

    public ArrayList<ArrayList<Integer>> threeSum(int[] num) {
        // Start typing your Java solution below
        // DO NOT write main() function
        Arrays.sort(num);
        ArrayList<ArrayList<Integer>> result = new ArrayList<ArrayList<Integer>>();
        if(num.length < 3) return result;
        for(int i = 0; i < num.length - 2 && num[i] <= 0; i++) {
            if(i > 0 && num[i] == num[i - 1]) continue; //skip the duplicate, pay attention here
            int start = i + 1; 
            int end = num.length - 1;
            while(start < end && num[end] >= 0) {
                if(num[i] + num[start] + num[end] == 0) {
                    ArrayList<Integer> sub = new ArrayList<Integer>(3);
                    sub.add(num[i]);
                    sub.add(num[start++]);
                    sub.add(num[end--]);
                    result.add(sub);
                    //pay attention here, skip the duplicate
                    while(start < end && num[start] == num[start - 1]) start++;
                    while(start < end && num[end] == num[end + 1]) end--;
                }else if(num[i] + num[start] + num[end] > 0) {
                    end--;
                }else {
                    start++;
                }
            }
        }
        return result;
    }



    public ArrayList<ArrayList<Integer>> threeSum(int[] num) {
        // Start typing your Java solution below
        // DO NOT write main() function
        Arrays.sort(num);  
        ArrayList<ArrayList<Integer>> result = new ArrayList<ArrayList<Integer>>();  
        Set<ArrayList<Integer>> set = new HashSet<ArrayList<Integer>>();
        if(num.length < 3) return result;  
        for(int i = 0; i < num.length - 2 && num[i] <= 0; i++) {  
            int start = i + 1;   
            int end = num.length - 1;  
            while(start < end && num[end] >= 0) {  
                if(num[i] + num[start] + num[end] == 0) {  
                    ArrayList<Integer> sub = new ArrayList<Integer>(3);  
                    sub.add(num[i]);  
                    sub.add(num[start++]);
                    sub.add(num[end--]);
                    set.add(sub);
                }else if(num[i] + num[start] + num[end] > 0) {  
                    end--;  
                }else {  
                    start++;  
                }  
            }  
        }  
        result.addAll(set);
        return result;   
    }