MaxSubarray , kadane's algorithm
This commit is contained in:
@@ -0,0 +1,20 @@
|
||||
package algo
|
||||
|
||||
// kadane's algorithm
|
||||
// https://www.youtube.com/watch?v=qj3CjNEKFeM
|
||||
|
||||
// MaxSubarray -> returns the max sum of possible sub arrays
|
||||
func MaxSubarray(array []int) int {
|
||||
minimum := array[0]
|
||||
maximum := 0
|
||||
|
||||
for i := 1; i < len(array); i++ {
|
||||
if array[i] < minimum {
|
||||
minimum = array[i]
|
||||
} else if array[i]-minimum > maximum {
|
||||
maximum = array[i] - minimum
|
||||
}
|
||||
}
|
||||
|
||||
return maximum
|
||||
}
|
||||
Reference in New Issue
Block a user