fourSum

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

note:Element in a quadruplet must be in non-desending order.

the solution set must not contain duplicate quadruplets.

code example :

  /// <summary>
        /// given an array s of n integers,are there elements a,b,c and d in s such that a+b+c+d=target? Find all unique quadruplets in the array which givens the sum of target.
        /// 给定一组有n个数组成的数组s 其中 a,b,c,d 能够满足a+b+c+d=target 
        /// note:Elements in a quadruplet must be in non-descending order.
        /// The solution set not contain duplicate quadruplet.
        /// </summary>
        /// <param name="nums"></param>
        /// <param name="target"></param>
        /// <returns></returns>
        static List<List<int>> fourSum(int[] nums,int target)
        {
            List<List<int>> result = new List<List<int>>();
            if (nums.Length < 3) return result;
            Array.Sort(nums);
            for(var i = 0; i < nums.Length; i++)
            {
                for(var j = i + 1; j < nums.Length; j++)
                {
                    int h = j + 1;
                    int k = nums.Length - 1;
                    while (h < k)
                    {
                        int sum = nums[i] + nums[j] + nums[h] + nums[k];
                        if (sum < target)
                        {
                            h++;
                            while (h < k && nums[h] == nums[h + 1]) h++;
                        }
                        else if(sum>target)
                        {
                            k--;
                            while (h < k && nums[k] == nums[k - 1]) k--;
                        }
                        else
                        {
                            result.Add(new List<int> { nums[i], nums[j], nums[h], nums[k] });
                            k--;
                            h++;
                            while (h < k && nums[h] == nums[h + 1]) h++;
                            while (h < k && nums[k] == nums[k - 1]) k--;
                        }




                    }
                }
            }
            return result;
        }