input: Write a function that finds the maximum sum of an array of non-negative integers, given an upper limit value. Return the maximum sum that does not exceed the limit. If the array is empty, 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])==14
  assert findMaxSum(8, [1, 3, 5, 4, 2, 6])==7
  assert findMaxSum(5, [1, 3, 5, 4, 2, 6])==5
  assert findMaxSum(0, [1, 3, 5, 4, 2, 6])==0
  assert findMaxSum(10, [])==0
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