01个人作业课堂——求最大子数组的和01

 

 

public class piactice {
    public static void main(String[] args) throws FileNotFoundException {
        Scanner scanner = new Scanner(new FileReader("src/main/java/bean/aa.txt"));
        String str = scanner.next().toString();
        String[] arr = str.split(",");
        int[] b = new int[arr.length];
        int i ;
        int j ;
        for (j = 0; j < b.length; j++) {
            b[j] = Integer.parseInt(arr[j]);
        }
        int Sum = 0;
        int maxSum = 0;
        int d;
        for (j = 0; j < b.length; j++) {
            for (i = j; i < b.length; i++) {
                Sum += b[i];
                if (Sum > maxSum) {
                    maxSum = Sum;
                }
                if (Sum < 0) {
                    Sum = 0;
                }
            }
            Sum = 0;
        }

        if (maxSum == 0) {
            for (i = 0; i < b.length; i++) {
                if (i == 0) {
                    maxSum = b[i];
                }
                if (b[i] > maxSum) {
                    maxSum = b[i];
                }
            }
        }
        System.out.println(maxSum);
    }
}
还没有完全实现所有功能