Maximum Subarray

Find the contiguous subarray within an array (containing at least one number) which has the largest sum.

For example, given the array

[-2,1,-3,4,-1,2,1,-5,4],

the contiguous subarray

[4,-1,2,1]

has the largest sum = 6.

Scala

def maxSubArray(nums: Array[Int]): Int = {
  var sum = nums.head
  var maxSum = nums.head
  for (i <- nums) {
    sum = i max sum + i
    maxSum = sum max maxSum
  }
  maxSum
}

val nums = Array(-2, 1, -3, 4, -1, 2, 1, -5, 4)
maxSubArray(nums)

Second Tab