代码挑战: 最大子数组 #Kotlin

Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.

Example:

Input: [-2,1,-3,4,-1,2,1,-5,4],
Output: 6
Explanation: [4,-1,2,1] has the largest sum = 6.

方案：

internal class Solution {
    fun maxSubArray(nums: IntArray): Int {
        var result = nums[0]
        var temp = nums[0]

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

测试案例：

@Test
fun test1() {
    val solution = Solution()
    val nums = intArrayOf(-2)
    val result = solution.maxSubArray(nums)
    Assert.assertEquals(result, -2)
}

@Test
fun test2() {
    val solution = Solution()
    val nums = intArrayOf(-2, -3, 4, -1, -2, 1, 5, -3)
    val result = solution.maxSubArray(nums)
    Assert.assertEquals(result, 7)
}

@Test
fun test3() {
    val solution = Solution()
    val nums = intArrayOf(-2,1,-3,4,-1,2,1,-5,4)
    val result = solution.maxSubArray(nums)
    Assert.assertEquals(result, 6)
}