算法经典问题--三数之和

下面是测试代码：

import java.util.HashMap;

public class TripleSum {
    public static void main(String[] args) {
    int[] test = {1,1,2,2,3,0,1};
    int goal = 4;
    tripleSum(test,goal);
    }
//散列算法
    public static void tripleSum(int[] array,int goal){
        HashMap map = new HashMap();
        HashMap map2 = new HashMap();

        for (int i = 1; i < array.length ; i++) {
            map.put(array[i],i);
        }
        for (int i = 0; i < array.length-1; i++) {
            int temp = goal - array[i];
            for (int j = i+2; j < array.length ; j++) {
                map2.put(array[j],j);
            }

            for(int j = i+1 ;jj){
                    System.out.println("["+i+","+j+","+map2.get(temp2)+"]");
                }
            }
        }
    }
}

结果：

Leetcode 要求输出的是去重复的Key的List

这个下次再说。