input: Write a function to find the maximum sum of an array of non-negative integers, given an upper limit value. If the given array is empty then return 0.
  def findMaxSum(limit, array):
      maxSum = 0
      for i in range(len(array)):
          currentSum = 0
          for j in range(i, len(array)):
              currentSum += array[j]
              if currentSum <= limit and currentSum > maxSum:
                  maxSum = currentSum
      return maxSum
  
  assert findMaxSum(10, [1, 3, 5, 4, 2, 6]) == 9
  assert findMaxSum(15, [1, 3, 5, 4, 2, 6]) == 15
  assert findMaxSum(5, [1, 3, 5, 4, 2, 6]) == 5
  assert findMaxSum(20, []) == 0
  assert findMaxSum(10, [1, 11, 3, 5, 4, 2, 6]) == 10
output: def findMaxSum(limit, array):
      maxSum = 0
      for i in range(len(array)):
          currentSum = 0
          for j in range(i, len(array)):
              currentSum += array[j]
              if currentSum <= limit and currentSum > maxSum:
                  maxSum = currentSum
      return maxSum