15. 3Sum

• Question Description
  
• My Key

package LeetCode;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
public class Test {
      
      public static void main(String[] args) {
            int[] a = {-1,0,1,2};
            System.out.println(threeSum(a));
            
            int[] b = {-1,0,1,1,2};
            System.out.println(threeSum(b));
            
            int[] c = {-1,0,1,1,2,-1};
            System.out.println(threeSum(c));
            
            int[] d = {-2,-2,-1,-1,-1,-1,0,1,1,2,3};
            System.out.println(threeSum(d));
            
            int[] d2 = {-1, 0, 1, 2, -1, -4};
            System.out.println(threeSum(d2));
            
            int[] d3 = {-2,0,0,2,2};
            System.out.println(threeSum(d3));
      }
      
    public static List<List<Integer>> threeSum(int[] nums) {
       List<List<Integer>> answer = new ArrayList<List<Integer>>();
       
       //1. sort nums in ascending order
       Arrays.sort(nums);
       
       if (nums.length == 0 || nums.length < 3) {
             return answer;
       }
       
       for (int i = 0; i < nums.length; i++) {
             //2. 起始去重
             if (i > 0 && nums[i]==nums[i-1]) {
                   continue;
             }
             
             int m = i+1;
             int n = nums.length-1;
             int sum = 0;
             
             while (m < n) {
                   sum = nums[i]+nums[m]+nums[n];
                   
                   //3. 中间去重
                   if ((m > i+1 && nums[m]==nums[m-1]) || sum < 0) {
                         m++;
                   } else if ((n < nums.length-1 &&  nums[n]==nums[n+1])||sum > 0) {
                         n--;
                   } else {
                         System.out.println("nums["+i+"]:"+nums[i]+"nums["+m+"]:"+nums[m]+"nums["+n+"]:"+nums[n]);
                         List list = new ArrayList();
                         list.add(nums[i]);
                         list.add(nums[m++]);
                         list.add(nums[n--]);
                         answer.add(list);
                   }
             }
       }
       
       return answer;
    }
}