Commit 8e3997e

authored

Improved readability

1 parent 81a11e1 commit 8e3997eCopy full SHA for 8e3997e

File tree

-12

lines changed

-12

lines changed

Lines changed: 8 additions & 12 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,17 +1,13 @@`
`1`	`1`	`#Kadane's Algorithm`
`2`	`2`
`3`		`-def kadaneAlgo(n,arr):`
`4`		`- sum_num = 0`
`5`		`- max_sum = 0`
`6`		`- for i in range(n):`
`7`		`- sum_num += arr[i]; #maximum ending here`
`8`		`- if arr[i] > sum_num:`
`9`		`- sum_num = arr[i]`
`10`		`- if max_sum < sum_num: #comparing maximum ending here , maximum so far`
`11`		`- max_sum = sum_num`
	`3`	`+def kadaneAlgo(arr):`
	`4`	`+ maxSumSoFar = arr[0]`
	`5`	`+ max_sum = arr[0]`
	`6`	`+ for ele in arr[1:]:`
	`7`	`+ maxSumSoFar = max(ele, ele + maxSumSoFar) #current maximum sum so far`
	`8`	`+ max_sum = max(max_sum, maxSumSoFar) #maximum sum so far`
`12`	`9`	`return max_sum`
`13`	`10`
`14`		`-n = int(input())`
`15`		`-l = [int(x) for x in input().split()]`
`16`		`-max_sm = kadaneAlgo(n,l)`
	`11`	`+l = list(map(int, input().split()))`
	`12`	`+max_sm = kadaneAlgo(l)`
`17`	`13`	`print(max_sm)`

Comments

(0)