https://leetcode.com/problems/maximum-subarray/

leetcode_53_maximum_subarray.kt

fun main() {
	println(maxSubArray(intArrayOf(-2,1,-3,4,-1,2,1,-5,4)))
}

fun maxSubArray(nums: IntArray): Int {
	var currentMax = nums[0]
	var max = nums[0]

	for (i in 1 until nums.size) {
	    currentMax = Math.max(nums[i], nums[i]+currentMax)
	    max = Math.max(currentMax, max)
	}

	return max
}

https://leetcode.com/problems/maximum-subarray/discuss/20211/Accepted-O(n)-solution-in-java