Skip to content

Kadane's algorithm in Kotlin (issue #104) #209

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
bhoomchai wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Kadane's algorithm in Kotlin (issue #104) #209

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
22 changes: 22 additions & 0 deletions Kotlin/Kadane.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,22 @@
import java.util.*

fun maxSumSubArray (array: IntArray): Int {
var local_max = 0
var global_max = Int.MIN_VALUE
for (i in array.indices) {
local_max = maxOf(array[i], array[i] + local_max)
if(local_max > global_max)
global_max = local_max;
}
return global_max
}

fun main() {
var array = intArrayOf(2, -1, 4, 5, -4, 1, 2, -3, 5, 4, 1, -5, 3, -4)
println("Input array: ${Arrays.toString(array)}")
println("The maximum sum of contiguous subarray is ${maxSumSubArray(array)}.")

var array2 = intArrayOf(-2, -3, 4, -1, -2, 1, 5, -3)
println("Input array: ${Arrays.toString(array2)}")
println("The maximum sum of contiguous subarray is ${maxSumSubArray(array2)}.")
}