给定一个整数数组,求它的子数组(连续)里面最大的和是多少
算法思路来自于:http://www.julyedu.com/video/play/id/19 中思路四,代码相对迭代算法简单很多,思路也容易理解,我谨将C++算法转换成scala算法,其他思路请到七月算法中查看,如有错误请指正。
object test{
val a = Array(1,-2,3,-20,-5,4,5,4,5)
def maxSubArray(arr: Array[Int]): Int = {
var answer = arr(0)
for (x <- 1 to arr.length - 1) {
answer = arr(x).max(answer + arr(x))
}
answer
}
maxSubArray(a) //res0: Int = 18
}