leetcode 15——三数之和

①从小到大排序

②循环

 

  public List<List<Integer>> threeSum(int[] nums) {
        List<List<Integer>> lists = new ArrayList<>();

        Arrays.sort(nums);

        int len = nums.length;
        for(int i = 0;i < len;++i) {
            if(nums[i] > 0) 
                return lists;

            if(i > 0 && nums[i] == nums[i-1]) 
                continue;     //continue 语句是跳过循环体中剩余的语句而强制执行下一次循环

            int curr = nums[i];
            int L = i+1, R = len-1;     //双指针
            while (L < R) {
                int tmp = curr + nums[L] + nums[R];     //求和
                if(tmp == 0) {
                    List<Integer> list = new ArrayList<>();
                    list.add(curr);
                    list.add(nums[L]);
                    list.add(nums[R]);
                    lists.add(list);
                    while(L < R && nums[L+1] == nums[L]) ++L;
                    while (L < R && nums[R-1] == nums[R]) --R;
                    ++L;
                    --R;
                } else if(tmp < 0) {
                    ++L;
                } else {
                    --R;
                }
            }
        }
        return lists;
    }