最大子段求和问题

来源：互联网发布：周晨曦淘宝店名编辑：程序博客网时间：2024/05/16 05:16

最大子段求和问题，一趟for循环

import java.util.Scanner;public class test1 {//最大字段求和问题。    public static int findGreatestSumOfSubArray(int[] ary) {        if (ary.length == 0) {            return 0;        }        Integer sum = ary[0];        int tempsum = ary[0];        for (int i = 1; i < ary.length; i++) {             tempsum = (tempsum < 0) ? ary[i] : tempsum + ary[i];            sum = (tempsum > sum) ? tempsum : sum;        }        return sum;    }    public static void main(String[] args) {        Scanner sc = new Scanner(System.in         );        String[] s = sc.nextLine().trim().split(" ");        int[] ary = new int[s.length];        for (int i = 0; i < s.length; i++) {            if (!"".equals(s[i])) {                ary[i] = Integer.parseInt(s[i]);            }        }        System.out.println(findGreatestSumOfSubArray(ary));    }}

阅读全文

0 0