数组中最大子数组求和问题

使用暴力求解法，算出所有子数组的和，比较大小，得出结果，代码如下

package cn.edu.niit.test2;

/**
 * Created by Wang Yifan on 2017/03/17.
 */

public class Test2 {
    int MaxSubArray(int[] A, int n)
    {
        int maxSum = A[0];  //全负情况，返回最大负数
        int currSum = 0;
        for (int i = 0; i < n; i++)
        {
            for (int j = i; j < n; j++)
            {
                for (int k = i; k <= j; k++)
                {
                    currSum += A[k];
                }
                if (currSum > maxSum)
                    maxSum = currSum;

                currSum = 0;
            }
        }
        return maxSum;
    }
}

对此方法进行测试，验证算法是否正确，代码如下

package cn.edu.niit.test2;

import org.junit.Before;
import org.junit.Test;

import static org.junit.Assert.*;

/**
 * Created by Wang Yifan on 2017/03/17.
 */

public class Test2Test {
    private  Test2 Array;

    @Before
    public void setUp() throws Exception {
        Array = new Test2();
    }

    @Test
    public void maxSubArray() throws Exception {
        int []Array1={-1,2,3,-4};
        assertEquals(5d,Array.MaxSubArray(Array1,Array1.length),4);

        int []Array2={-1,2,-5,3,-4};
        assertEquals(3d,Array.MaxSubArray(Array2,Array2.length),5);

        int []Array3={-1,20,-5,30,-4};
        assertEquals(45d,Array.MaxSubArray(Array3,Array3.length),5);

        int []Array4={-2,-3,-5,-1,-9};
        assertEquals(-1d,Array.MaxSubArray(Array4,Array4.length),5);
    }
}

验证结果如下图，算法正确