Bernard Wong
  • Software Engineer
  • Problems
    • Lowest Common Ancestor of a Binary Tree
    • Longest Substring Without Repeating Characters
    • Longest Palindromic Substring
    • Longest Common Prefix
    • Isomorphic Strings
    • Integer to Roman
    • Frog Jump
    • Find the Difference
    • Find k closest elements to a given value
    • Longest Common Subsequence
    • Binary Search Tree from Sorted Array
    • Balanced Binary Tree
    • Sort Using Two Stacks
    • O(1) Stack
    • k-th element to last of a LinkedList
    • Dedup LinkedList
    • Check Rotated String
    • Compress String by Character Count
    • Escape HTML whitespace
    • Check String Permutation
    • Unique String
    • Container With Most Water
    • 4 Sum
    • 3 Sum Closest
    • 3 Sum
    • 2 Sum
    • Maximum Subarray
    • Nested List Weight Sum
    • Palindrome Number
    • Pow(x, n)
    • Regular Expression Matching
    • Remove Nth Node From End of List
    • Reverse Integer
    • Roman to Integer
    • Rotate Array
    • Search a 2D Matrix
    • Shortest Word Distance
    • Two Sum III - Data structure design
    • Valid Parentheses
    • ZigZag Conversion
    • Quicksort
    • Add Two Numbers
    • Best Time to Buy and Sell Stock
    • Letter Combinations of a Phone Number
  • Data Structures
    • Heap
Powered by GitBook
On this page
  1. Problems

4 Sum

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 gives the sum of target.

Note: The solution set must not contain duplicate quadruplets.

For example, given array

S = [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] ]
import scala.util.Sorting.quickSort

def fourSum(nums: Array[Int], target: Int):List[(Int,Int,Int,Int)] = {
  quickSort(nums)
  var ret:List[(Int,Int,Int,Int)] = Nil
  for (i <- 0 until nums.length) {
    for (j <- i + 1 until nums.length) {
      // fixed first two indexes
      var (k,l) = (j + 1, nums.length - 1)
      while (k < l) {
        nums(i)+nums(j)+nums(k)+nums(l) match {
          case sum if sum == target => {
            val tup = (nums(i),nums(j),nums(k),nums(l))
            // check duplicate
            if (ret.isEmpty || tup != ret.head) {
              ret = tup :: ret
            }
            l -= 1
            k += 1
          }
          case sum if sum > target => l -= 1
          case sum if sum < target => k += 1
        }
      }
    }
  }
  ret
}

fourSum(Array(1, 0, -1, -1, 0, -2, 2), 0)

PreviousContainer With Most WaterNext3 Sum Closest

Last updated 6 years ago