53.最大子数组和

1.分治法

#include<iostream>
#include<string>
#include<vector>
using namespace std;
int maxSubArray(vector<int>& nums);
int getmax(vector<int>a,int b,int c);
int main()
{
    vector<int> a={-2,-1,-3,4,-1,2,1,-5,4};
    cout <<maxSubArray(a)<< endl;
    return 0;
}
int maxSubArray(vector<int>& nums)
{
   return getmax(nums,0,nums.size()-1);
}
int getmax(vector<int>a,int b,int c)
{
   int Lmax,Rmax,lmax=a[(b+c)/2],rmax=a[(b+c)/2+1],sum=0,mmax;
   if(b==c)
   {
     return a[b];
     //cout<<a[b]<<endl;
   }
   Lmax=getmax(a,b,(b+c)/2);
   Rmax=getmax(a,(b+c)/2+1,c);
   for(int i=(b+c)/2;i>=b;i--)
   {
      sum+=a[i];
      lmax=sum>lmax?sum:lmax;
   }
   sum=0;
   for(int i=(b+c)/2+1;i<=c;i++)
   {
      sum+=a[i];
      rmax=sum>rmax?sum:rmax;
   }
   mmax=lmax+rmax;
   return (Lmax>Rmax?Lmax:Rmax)>mmax?(Lmax>Rmax?Lmax:Rmax):mmax;
}

2.dp

#include<iostream>
#include<string>
#include<vector>
using namespace std;
int maxSubArray(vector<int>& nums);
int main()
{
    vector<int> a={-2,-1,-3,4,-1,2,1,-5,4};
    cout <<maxSubArray(a)<< endl;
    return 0;
}
int maxSubArray(vector<int>& nums)
{
   int n=nums.size(),lmax=nums[0];
   int max;
   max=nums[0];
   for(int i=1;i<n;i++)
   {
      if(max+nums[i]>nums[i])
        max=max+nums[i];
      else
        max=nums[i];
      lmax=max>lmax?max:lmax;
   }
   return lmax;
}