LeetCode- Three Sum

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.
For example, given array S = [-1, 0, 1, 2, -1, -4],

A solution set is:
[
[-1, 0, 1],
[-1, -1, 2]
]

---

Solutions:

Approach#01[Brute Force](Time Limited)

package three_sum;

import java.util.*;

/**
 * Created by Administrator on 2017/8/25.
 */
public class Solution {
    public static List<List<Integer>> threeSum(int[] nums) {
        int target = 0;
        int len = nums.length;

        HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
        for (int i = 0; i < len; i++) {
            map.put(i, nums[i]);
        }

        int i, j, complement;
        List<List<Integer>> result = new ArrayList<List<Integer>>();
        for (i = 0; i < len - 1; i++) {
            for (j = i + 1; j < len; j++) {
                complement = target - (nums[i] + nums[j]);
                if (map.containsValue(complement)) {
                    for (Integer key : map.keySet()) {
                        if (map.get(key) == complement && key != i && key != j && key >= j) {
                            List<Integer> list = new ArrayList<Integer>();
                            list.add(map.get(i));
                            list.add(map.get(j));
                            list.add(map.get(key));
                            Collections.sort(list);

                            if(!result.contains(list)){
                                result.add(list);
                            }
                            System.out.println(result);
                        }
                    }
                }
            }
        }
        return result;
    }
}

Approach#02 [CleanCode]( Ac cepted )

package three_sum;

import java.util.Arrays;
import java.util.LinkedList;
import java.util.List;

/**
 * Created by Administrator on 2017/8/28.
 */
public class LeetcodeSolution {
    public List<List<Integer>> threeSum(int[] num) {
        Arrays.sort(num);
        List<List<Integer>> res = new LinkedList<>();
        for (int i = 0; i < num.length - 2; i++) {
            if (i == 0 || (i > 0 && num[i] != num[i - 1])) {
                int lo = i + 1, hi = num.length - 1, sum = 0 - num[i];
                while (lo < hi) {
                    if (num[lo] + num[hi] == sum) {
                        res.add(Arrays.asList(num[i], num[lo], num[hi]));
                        while (lo < hi && num[lo] == num[lo + 1]) lo++;
                        while (lo < hi && num[hi] == num[hi - 1]) hi--;
                        lo++;
                        hi--;
                    } else if (num[lo] + num[hi] < sum) lo++;
                    else hi--;
                }
            }
        }
        return res;
    }
}