子数组最大求和（续）

package shuzu;

import java.io.*;
import java.util.*;

public class shuzu {
    public static void main(String[] args) throws IOException{
        
        String path = "F:\\JAVA_2019\\shuzu\\shuzu.txt";
          double[] nums = writeToDat(path);
          int[] shuzu= new int[nums.length];
          for(int i=0;i<nums.length;i++){
           shuzu[i]=(int)nums[i];
          }
        //时间复杂度没有实现，只是实现了输出最大值
        int nshu;//循环的次数
        int shu[] = {-1,3,-6,-5,-2}; 
        int max = (int)shuzu[0];//存储最大的和
        for(nshu=0;nshu<nums.length;nshu++) {
            int n1 = 0;
            int n2 = 0;
            for(int nnshu=nshu;nnshu<nums.length;nnshu++) {
                n1 = n1 + shuzu[nnshu];
                if(nnshu<4) {
                    nnshu = nnshu + 1;
                    n2 = n1 + shuzu[nnshu];
                    max = maxxx(n1,n2,max);
                    nnshu = nnshu - 1;
                }else {
                    max = maxx(n1,max);
                }
            }
        }
        System.out.println("最大值" + max);
        System.exit(0);
    }
    
    static int maxxx(int a,int b,int ab) {
        int max;
        if(a<b) {
            max = b;
            if (max<ab) {
                max = ab;
            }
        }else {
            max = a;
            if(max<ab) {
                max = ab;
            }
        }
        return max;
    }
    
    static int maxx(int a , int b){
        int max;
        if(a<b) {
            max = b;
        }else {
            max = a;
        }
        return max;
    }
    
    public static double[] writeToDat(String path) {
          File file = new File(path);
          List list = new ArrayList();
          double[] nums = null;
          try {
           BufferedReader bw = new BufferedReader(new FileReader(file));
           String line = null;
           //因为不知道有几行数据，所以先存入list集合中
           while((line = bw.readLine()) != null){
            list.add(line);
           }
           bw.close();
          } catch (IOException e) {
           e.printStackTrace();
          }
          //确定数组长度
          nums = new double[list.size()];
          for(int i=0;i<list.size();i++){
           String s = (String) list.get(i);
           nums[i] = Double.parseDouble(s);
          }
          return nums;
         }
}