[数据结构]求数组和为最大的子序列

/**
 * Created by Administrator on 2018/4/12.
 */
public class MainSubArraySeq {

    void getMainSubArraySeq(int[] array){
        int maxSumValue = 0;
        int start=0,end=0;
        if(array.length == 0){
            return ;
        }
        for(int i=0; i<array.length; i++){
            for(int j=i; j<array.length;j++){
                int tempValeu = 0;
                for(int k=i; k<=j; k++){
                    tempValeu += array[k];
                }
                if(tempValeu > maxSumValue){
                    maxSumValue = tempValeu;
                    start = i;
                    end = j;
                }
            }
        }
        System.out.println("maxvlaue "+maxSumValue+"  from array["+start+"] to array["+end+"]");
    }

    public static void main(String[] args){
        int[] array = {-2, 11, -4, 13, -5, -2};
        MainSubArraySeq mainSubArraySeq = new MainSubArraySeq();
        mainSubArraySeq.getMainSubArraySeq(array); 
    }

}