求整数数组中子数组最大的和值!

public class  array

  {

  public static void main(String[] args)

    {

     int[]a={1 ,-2,3,-4,3,4,6,-2,4,-5};

     int max=maxsum(a);

    System.out.println("max="+max);

    }

     public static int maxsum(int a[])

    {

      int sum=0,max=0;

      for(int i=0;i<a.length;i++)

        {

          sum=sum+a[a.length-i-1];

          if(a[a.length-i-1]>0)

            if(sum>max)

            {

              max=sum;

            }

           if(sum<0)

            {

                 sum=0;

            }

                  return max;

              }

            }

 }    

原文地址:https://www.cnblogs.com/dxl12306/p/3591762.html