返回一个整数数组中最大子数组的和02

 

 这个要求现在大概算是完成了吧

输入long的范围以内的数都不会有数据溢出

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.Scanner;

public class t2 {
    public static long max(long a,long b) {
        return a>b?a:b;
    }

    public static void main(String[] args){
        long peak=0,drop=0;
        String s = "";
        BufferedReader br= null;
        try {
            br = new BufferedReader(new FileReader("src\\input.txt"));
        String line = null;
        while(true)
        {

            if (!((line=br.readLine())!=null)) break;
            s+=line;
//            System.out.println(s);
        }
        String[] str = s.split(",");
        int x = Integer.parseInt(str[0]);
        int y = Integer.parseInt(str[1]);
        long[] point = new long[x*y];
        for(int i=0;i<x*y;i++)
        {
            point[i] = Long.parseLong(str[i+2]);
        }
        for(int z=0;z<x*y;z++){
            if(z==0){
                peak = point[z];
                drop = point[z];
            }else{
                if (drop<0){
                    drop = point[z];
                }else{
                    drop+=point[z];
                }
            }
            peak = (peak>drop)?peak:drop;
        }
        System.out.println("最大子数组之和为"+peak);
        } catch (IOException e) {
            System.out.println("出现异常，程序终止！！！");
            e.printStackTrace();
        }
    }
}