最大子序列和算法最优解--Java

public class MaxSubSumClass {


public static void main(String[] args) {

int[] array = {2,6,9,-10,-30,90};
System.out.println(maxSubMax(array));
}

public static int maxSubMax(int[] array){
int maxSum = 0, thisSum = 0;
for(int i=0;i<array.length;i++){

thisSum +=array[i];

if(thisSum > maxSum){
maxSum = thisSum;
}
if(thisSum < 0){
thisSum = 0;
}
}

return maxSum;
}


}