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