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: The solution set must not contain duplicate triplets.

package com.dengpf.ThreeSome;

import java.lang.reflect.Array;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

/**
 * Created by kobe73er on 16/12/17.
 */
public class Solution {

    public static void main(String[] args) {
        int[] a = {1,2,-2,-1};
//[[-1,-1,2],[-1,0,1]]
        Solution solution = new Solution();
        solution.threeSome(a);
//     System.out.println(solution.twoSum(a, 1));

    }

    public static int[] copyOfRange(int[] original, int from, int to) {
        int newLength = to - from;
        if (newLength < 0)
            throw new IllegalArgumentException(from + " > " + to);
        int[] copy = new int[newLength];
        System.arraycopy(original, from, copy, 0,
                Math.min(original.length - from, newLength));
        return copy;
    }


    List<List<Integer>> rlist = new ArrayList<List<Integer>>();

    public List<List<Integer>> threeSome(int[] a) {
        List<List<Integer>> rlist = new ArrayList<List<Integer>>();

        if (a == null || a.length < 3) {
            return rlist;
        }

        int location = 0;
        Arrays.sort(a);
        while (location < a.length - 2) {
            if (location != 0 && a[location] == a[location - 1]) {
                location++;
                continue;
            }
            int[] r = copyOfRange(a, location+1, a.length);


            List<List<Integer>> twolist = twoSum(r, -a[location]);

            if (twolist != null && twolist.size() != 0) {
                System.out.print(a[location]);
                System.out.println(twolist);

            }
            location++;
        }
        return rlist;
    }


    public List<List<Integer>> twoSum(int nums[], int target) {
        List<List<Integer>> list = new ArrayList<List<Integer>>();

        if (nums == null || nums.length < 2) {
            return list;
        }
        int head = 0;
        int tail = nums.length - 1;

        Arrays.sort(nums);


        while (head < tail) {
            if ((head != 0) && (nums[head] == nums[head - 1])) {
                head++;
                continue;
            }
            if ((tail != nums.length - 1) && nums[tail] == nums[tail + 1]) {
                tail--;
                continue;

            }

            if (nums[head] + nums[tail] > target) {
                tail--;
                continue;
            }
            if (nums[head] + nums[tail] < target) {
                head++;
                continue;
            }
            if (nums[head] + nums[tail] == target) {
                List<Integer> innerlist = new ArrayList<Integer>();

                innerlist.add(nums[head]);
                innerlist.add(nums[tail]);
                list.add(innerlist);
                head++;
                tail--;
            }
        }
        return list;

    }


}