面试笔试总结----数组

1. 最大子序列，动态规划。

private static int MaxSubSequence(int[] arr) {
    int maxSum = 0, thisSum = 0;

    for (int i = 0; i < arr.length; i++) {
        thisSum += arr[i];
        if (thisSum > maxSum) {
            maxSum = thisSum;
        } else if (thisSum < 0) {
            thisSum = 0;
        }
    }

    return maxSum;
}