leetcode-15. 3Sum

https://leetcode.com/problems/3sum/#/description
问题描述：
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]
]

思路：Arrays类有sort()给数组排序（升序），Arrays.asList(“若干数组元素”)方法将一个数组中的元素放入到链表当中。设立三个指针i,j,k,i在最外层，j=i+1，k在数组末端，根据sum值和0进行比较，通过前后移动指针（类似于二分查找的思想）来缩小范围，最终得到0值，放入链表当中。while(nums[k–]==nums[k] && j

public class Solution {
    public List<List<Integer>> threeSum(int[] nums) {

        int i=0;

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

            if(nums.length<3) return result;

            Arrays.sort(nums);

            while(i<nums.length-2)
            {
                int j=i+1;
                int k=nums.length-1;


                    while(j<k)
                    {
                        int sum=nums[i]+nums[j]+nums[k];
                        if(sum==0) result.add(Arrays.asList(nums[i],nums[j],nums[k]));
                        if(sum<=0) while(nums[j]==nums[++j] && j<k);
                        if(sum>0) while(nums[k--]==nums[k] && j<k);

                    }

                    while(nums[i]==nums[++i] && i<nums.length-2);

            }

            return result;

    }
}