最大连续子序列和----动态规划

public static int maxSub1(List<Integer> list){
        int ThisSum,MaxSum,j;
        ThisSum = MaxSum =0;
        for(j = 0;j < list.size();j++)
        {
            ThisSum += list.get(j);

            if(ThisSum > MaxSum)
                MaxSum = ThisSum;
            else if(ThisSum < 0)
                ThisSum = 0; 
        }
        return MaxSum; 
    }