LeetCode #3 Maximum Subarray

maximum_subarray.kt

fun main(args: Array<String>) {
    maxSubArray(intArrayOf(-2,1,-3,4,-1,2,1,-5,4))
}

fun maxSubArray(nums: IntArray): Int {
    val maxSums = mutableListOf<Int>()
    nums.toList()
    var i = 0
    while (i < nums.size) {
        val subList = nums.toList().subList(i, nums.size)
//        println(subList)
        maxSums.add(findMaxFromIndex(subList))
        i++
    }
    println(maxSums)
    return maxSums.max()!!
}

fun findMaxFromIndex(numList: List<Int>): Int {
    var index = 0
    var end = index + 1

    val sums = mutableListOf<Int>()

    var i = 0
    while (i < numList.size) {
        var sum = numList.subList(index, end).sum()
        sums.add(sum)
//        println(Pair(index, end))
//        println(sum)
        end++
        i++
    }

    val maxSum = sums.max()!!
//    println(maxSum)
    return maxSum
}