fork download 
  1. def maxSubArray(nums):
  2.     maxSum = - (10**5)
  3.     for i in range(1,len(nums)+1):
  4.         print(i)
  5.         left = 0
  6.         right = left + i
  7.         while right <= len(nums) + 1: 
  8.             s = sum(nums[left:right])
  9.             print(left, right, nums[left:right], s)
  10.             maxSum = max(s, maxSum)
  11.             left +=1
  12.             right += 1
  13.     return maxSum
  14.  
  15. print(maxSubArray([-1]))
  16. print(sum([-1][1:2]))
Success #stdin #stdout 0.09s 14040KB
comments (?)
stdin 
Standard input is empty
stdout 
1
0 1 [-1] -1
1 2 [] 0
0
0
https://ideone.com/QJlbSj
language:
Python 3 (python  3.12)
created:
1 day ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!