L15三数之和

排序 + 双指针

package leetcode.editor.cn;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

/**
 * 三数之和
 *
 * @author Cao Ziqiang
 * @date 2022-09-28 14:46:30
 */
public class P15_ThreeSum {
    public static void main(String[] args) {
        //测试代码
        Solution solution = new P15_ThreeSum().new Solution();
        int[] ints = new int[]{-1,0,1,2,-1,-4};

        System.out.println(solution.threeSum(ints));
    }

    //代码
//leetcode submit region begin(Prohibit modification and deletion)
    class Solution {
        public List<List<Integer>> threeSum(int[] nums) {
            int n = nums.length;
            //数组排序
            Arrays.sort(nums);
            ArrayList<List<Integer>> ans = new ArrayList<>();

            //枚举a
            for(int first = 0;first < n;++first){
                //需要和上一次枚举的数不同，相同结束本次循环
                if(first > 0 && nums[first] == nums[first-1]){
                    continue;
                }
                //c对应的指针初始指向数组的最右端
                int third = n-1;
                //定义third和second的和是-nums[first],转为两数之和的问题
                int target = -nums[first];
                //枚举b，b在first后加1
                // 仅仅在循环上保证second< third还不够，因为循环体内还会对third处理
                //有可能造成判断循环条件是满足条件，处理后不满足条件，从而导致结果出错
                for(int second = first +1;second <n;++second){
                    //需要和上一次枚举的数不同，相同则结束本次循环
                    if(second > first +1 && nums[second] == nums[second -1]){
                        continue;
                    }
                    //需要保证b的指针在c的指针的左侧，如果两数之和>target,则向左移动third
                    while(second < third && nums[second] + nums[third] > target){
                        --third;
                    }
                    //如果指针重合，随着b后续的增加
                    //就不会有满足a+b+c=0 并且b<c的c了，可以退出循环
                    if(second == third){
                        break;
                    }
                    if(nums[second] + nums[third] == target){
                        ArrayList<Integer> list = new ArrayList<>();
                        list.add(nums[first]);
                        list.add(nums[second]);
                        list.add(nums[third]);
                        ans.add(list);
                    }
                }
            }
            return ans;
        }
    }
//leetcode submit region end(Prohibit modification and deletion)

}