每日总结-23.3.6

今日课上小练习

最大子数组和问题

public class Test {

    public static void main(String[] args) {
        //int[] arr = new int[] {1,-2,-3,4,5,-10,100,-5,6,-7,3,-1};
        //int[] arr = new int[] {-10,-2,-3,-4,-5,-10,-100,-5,-6,-7,-3,-1};
        int[] arr = new int[] {100,-2,-3,4,5,-10,100,-5,6,-7,3,-1};
        int n=arr[0],sum=arr[0];
        for(int i=1;i<arr.length;i++) 
        {
            if(n>0) 
            {
              n+=arr[i];
            }
            else
            {
              n=arr[i];
            }
            if(sum<n)
            {
               sum=n;
            }
        }
        System.out.print(sum);
        //test1();
}

 

posted @ 2023-03-06 21:24  lao_bing  阅读(19)  评论(0)    收藏  举报