leetcode: 18. 4Sum

Difficulty

Medium

Description

Given an array nums of n integers and an integer target, are there elements a, b, c, and d in nums such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target.

Note:

The solution set must not contain duplicate quadruplets.

Example:

Given array nums = [1, 0, -1, 0, -2, 2], and target = 0.

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

Solution

13ms, faster than 98%

class  Solution
{
	public List<List<Integer>> fourSum(int[] nums, int target) {
		
		List<List<Integer>> result = new ArrayList<>();

		if (nums.length < 4)
		{
			return result;
		}

        Arrays.sort(nums);

		if (4 * nums[nums.length - 1] < target)
		{
			return result;
		}


		for (int i = 0;i < nums.length - 3; i++)
		{
			if (nums[i] + nums[i + 1] + nums[i + 2] + nums[i + 3] > target)  //总和过大，结束
			{
				break;
			}

			if (nums[i] + nums[nums.length - 3] + nums[nums.length - 2] + nums[nums.length - 1] < target)   //总和过小，跳过
			{
				continue;
			}

			if (i > 0 && nums[i - 1] == nums[i])   //避免重复
				continue;
			
			for (int j = i + 1; j < nums.length - 2 ; j++)
			{
				if (nums[i] + nums[j] + nums[j + 1] + nums[j + 2] > target)  //总和过大，结束
				{
					break;
				}

				if (nums[i] + nums[j] + nums[nums.length - 2] + nums[nums.length - 1] < target)  //总和过小，跳过
				{
					continue;
				}
				
				if (nums[j - 1] == nums[j] && j - 1 != i)   //避免重复
					continue;
				
				int k = j + 1;
				int l = nums.length - 1;

				while (k < l)
				{
					if (nums[i] + nums[j] + nums[k] + nums[l] == target)
					{
						result.add(Arrays.asList(nums[i], nums[j], nums[k], nums[l]));
						
						k++;
						while (k < l && nums[k] == nums[k - 1]) 
							k++;

						l--;
						while (k < l && nums[l] == nums[l + 1])
							l--;
					} else if (nums[i] + nums[j] + nums[k] + nums[l] > target)
					{
						l--;

					} else {
						k++;					
					}
				}
			}
		}

		return result;
        
	}
	
}