input: Write a function to find the maximum sum of an array of non-negative integers, given an upper limit value. The function should return the largest sum that does not exceed the given limit. If the array is empty or all elements exceed the limit, it should 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])==10
  assert findMaxSum(15, [2, 4, 6, 8])==14
  assert findMaxSum(5, [1, 2, 3, 4, 5])==5
  assert findMaxSum(0, [1, 2, 3])==0
  assert findMaxSum(20, [])==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