input: Write a function to find the maximum sum of any contiguous sublist.
  assert function1([1, -2, 3, 4, -1, 2, 1, -5, 4]) == 9
  assert function1([-2, -3, 4, -1, -2, 1, 5, -3]) == 7
  assert function1([1, 2, 3, 4, 5]) == 15
output: def function1(lst):
      max_current = max_global = lst[0]
      for num in lst[1:]:
          max_current = max(num, max_current + num)
          if max_current > max_global:
              max_global = max_current
      return max_global