leetcode 15. 3Sum

Given an array nums of n integers, are there elements a, b, c in nums 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.

Example:

Given array nums = [-1, 0, 1, 2, -1, -4],

A solution set is:
[
  [-1, 0, 1],
  [-1, -1, 2]
]

 

public List<List<Integer>> threeSum(int[] nums) {
		List<List<Integer>> res = new  LinkedList<>();
		 Arrays.sort(nums);
		 for (int i = 0; i < nums.length-1; i++) {
			if (i==0||(i>0&&nums[i]!=nums[i-1])) {
				int target = nums[i]*-1;
				int start=i+1,end=nums.length-1;
				while (start<end) {
					if (nums[start]+nums[end]==target) {
						res.add(Arrays.asList(nums[i],nums[start],nums[end]));
						while (start<end&&nums[start]==nums[start+1]) start++;
						while (start<end&&nums[end]==nums[end-1]) end--;
						start++;end--;
					}
					while (start<end&&nums[start]+nums[end]<target) start++;			
					while (start<end&&nums[start]+nums[end]>target) end--;		
				}
			}			
		}	 
		 return res;
		  
    } 

    List<List<Integer>> res = new  LinkedList<>();

   res.add(Arrays.asList(nums[i],nums[start],nums[end]));

Arrays.asList():https://mp.weixin.qq.com/s?src=11&timestamp=1586279090&ver=2264&signature=0FP75xGrTlfnvZnKoJ6zh9QtVrrTTyiOE*MpYaA7-teFNYIuCpqLfzBUEdZ1WFpqVgrUg5EiQRGoje0*Z*D9h2hTQuSN3-hUYkY4GycETHHtCLeocY8DyAax-Xx*akZP&new=1