Given an array nums of n integers, return an array of all the unique quadruplets [nums[a], nums[b], nums[c], nums[d]] such that:
0 <= a, b, c, d < na, b, c, and d are distinctnums[a] + nums[b] + nums[c] + nums[d] == targetYou may return the answer in any order.
1 <= nums.length <= 200-10^9 <= nums[i] <= 10^9-10^9 <= target <= 10^9nums = [1,0,-1,0,-2,2], target = 0[[-2,-1,1,2],[-2,0,0,2],[-1,0,0,1]]nums = [2,2,2,2,2], target = 8[[2,2,2,2]]