题目不说了 ,下面直接写相关代码:
暴力解法n2版本,不必多说,代码直接走起O(N2)这里为了简便就只返回subarray maxsum的值 如果还要有数组下标 自行改动即可:
int maxsubary(int *s,int n)
{
int maxsum = 0 ;
int sum = 0 ;
int i ;
int j;
for(i=0; i<n; i++){
sum = 0;
for(j=i; j<n; j++){
sum = sum + s[j];
if(sum > maxsum){
maxsum = sum ;
}
}
}
return maxsum ;
}
暴力解法n3版本:
- int MaxSubArray(int *s,int N)
- {
- int sum=0,maxSum=0;
- for(int i=0;i<N;++i){
- for(int j=i;j<N;++j){
- sum=0;
- for(int k=i;k<=j;++k){
- sum+=s[k];
- }
- if(sum > maxsum){
- maxsum = sum ;
- }
- }
- }
- return maxSum;
- }
分治算法 O(nlgn) :
- int MaxSubArraySumDC_inArray(int A[],int left,int right)
- {
- if(left==right)return A[left]>0?A[left]:0; /*Exit Of Recursive*/
- int center=(left+right)/2;
- int leftSum=MaxSubArraySumDC_inArray(A,left,center);
- int rightSum=MaxSubArraySumDC_inArray(A,center+1,right);
- int leftSecSum=0,leftSecMaxSum=0; /*left section*/
- for(int i=center;i>=left;--i)
- {
- leftSecSum+=A[i];
- leftSecMaxSum=leftSecSum>leftSecMaxSum?leftSecSum:leftSecMaxSum;
- }
- int rightSecSum=0,rightSecMaxSum=0; /*right section*/
- for(int i=center+1;i<=right;++i)
- {
- rightSecSum+=A[i];
- rightSecMaxSum=rightSecSum>rightSecMaxSum?rightSecSum:rightSecMaxSum;
- }
- int CenterSum=leftSecMaxSum+rightSecMaxSum; /*get the maxSum from 3 sums*/
- int resSum=CenterSum;
- if(resSum<leftSum)resSum=leftSum;
- if(resSum<rightSum)resSum=rightSum;
- return resSum;
- }
动归算法O(n) :
int maxsubarray(int *s, int n)
{
int maxsum = s[1] ;
int sum = s[1] ;
int i = 0;
for(i = 0 ; i < n ; i++){
if(sum > 0){
sum = sum + s[i] ;
}
else{
sum = s[i] ;
}
if(sum > maxsum){
maxsum = sum ;
}
}
return maxsum ;
}