最大子序列的两种算法

//第一种算法int maxSubSum1( const vector<int> & a ){    int maxSum = 0;    for (int i = 0; i < a.size(); i++ ) {        int thisSum = 0;        for ( int j = 0; j < a.size(); j++ ) {            thisSum += a[j];                        if ( thisSum > maxSum) {                maxSum = thisSum;            }        }    }        return maxSum;}//第二种算法int maxSubSum2( const vector<int> & a ){    int maxSum = 0;    int thisSum = 0;        for ( int j = 0; j <a.size(); j++) {        thisSum += a[j];                if ( thisSum > maxSum) {            maxSum = thisSum;            thisSum = 0;        }    }