数组问题

1.数组越界和求和溢出

//作者：王炳午  董龙洋  日期：2015.3.28
#include<iostream.h>
#include<stdlib.h>
#include<time.h>
int main()
{
    cout<<"---------------------求数组中子数组和的最大值的小程序----------------------"<<endl;
    cout<<endl;
    signed long int a[1000];
    int i;
    int j;
    srand( (unsigned)time( NULL ) );//随机数种子为当前计算机时间。
    cout<<"得到的一组随机整数（1000个数）如下："<<endl;
    /*a[0]=2147483647;
    cout<<a[0]<<"	";*/
    for(i=0;i<1000;i++)
    {
     //随机生成长整型整数
        j=rand()%2;
        if(j==0)
        {
            a[i]=rand()%2147483648;
        }
        else
        {
            a[i]=0-rand()%2147483648;
        }
        cout<<a[i]<<"	";
    }
    cout<<endl;
    int sum=0;  
    int GreateSum=0;  
    for ( i=0;i<1000;i++)  
    {  
        //防止最大值溢出
        if(sum>2147483647)
        {
            sum=2147483647;
        }
        sum+=a[i];  
        if (sum<0)  
        {  
            sum=0;  
        }  
        if (sum>GreateSum)  
        {  
            GreateSum=sum;  
        }
        //防止最大值溢出
        if(GreateSum>2147483647)
        {
            GreateSum=2147483647;

        }
    }  
    if (GreateSum==0)  
    {  
        for (int i=0;i<1000;i++)  
        {  
            if (GreateSum==0)  
            {  
                GreateSum=a[i];  
            }  
            else  
            if (GreateSum<a[i])  
            {  
                GreateSum=a[i];  
            }  
        }  
    }  
    cout<<"最大值sum:"<<GreateSum<<endl;  
    system("pause");  
    return 0;  
}  

2.环形数组最大值

#include<iostream.h>
#include<stdlib.h>
#include<time.h>
int main()
{
    cout<<"---------------------求数组中子数组和的最大值的小程序----------------------"<<endl;
    cout<<endl;
    int a[5];
    int c[5];
    int b[10];
    int i;
    srand( (unsigned)time( NULL ) );//随机数种子为当前计算机时间。
    for(i=0;i<5;i++)
    {
        a[i]=rand()%22-11;//得到一组-10到10的整数；
        cout<<a[i]<<"	";
    }
    cout<<endl;
    for(i=0;i<9;i++)
    { 
        if(i<5)
            b[i]=a[i];
        else
            b[i]=a[i-5];
    //cout<<b[i]<<"	";
    }
    cout<<endl;
    //最大值求法
    int sum=0;  
    int GreateSum=0; 
    //1-5
    for ( i=0;i<5;i++)  
    {  
        sum+=b[i];  
        if (sum<0)  
        {  
            sum=0;  
        }  
        if (sum>GreateSum)  
        {  
            GreateSum=sum; 
        }
    }  
    if (GreateSum==0)  
    {  
        for (int i=0;i<5;i++)  
        {  
            if (GreateSum==0)  
            {  
                GreateSum=b[i];  
            }  
            else  
                if (GreateSum<b[i])  
                {  
                    GreateSum=b[i];
                }  
        }  
    }
    c[0]=GreateSum;
    //2-6
    sum=0;  
    GreateSum=0; 
    for ( i=1;i<6;i++)  
    {  
        sum+=b[i];  
        if (sum<0)  
        {  
            sum=0;  
        }  
        if (sum>GreateSum)  
        {  
            GreateSum=sum;  
        }
    }  
    if (GreateSum==0)  
    {  
        for (int i=1;i<6;i++)  
        {  
            if (GreateSum==0)  
            {  
                GreateSum=b[i];  
            }  
            else  
                if (GreateSum<b[i])  
                {  
                    GreateSum=b[i];  
                }  
        }  
    }
    c[1]=GreateSum;
    //3-7
    sum=0;  
    GreateSum=0; 
    for ( i=2;i<7;i++)  
    {  
        sum+=b[i];  
        if (sum<0)  
        {  
            sum=0;  
        }  
        if (sum>GreateSum)  
        {  
            GreateSum=sum;  
        }
    }  
    if (GreateSum==0)  
    {  
        for (int i=2;i<7;i++)  
        {  
            if (GreateSum==0)  
            {  
                GreateSum=b[i];  
            }  
            else  
                if (GreateSum<b[i])  
                {  
                    GreateSum=b[i];  
                }  
        }  
    }
    c[2]=GreateSum;
    //4-8
    sum=0;  
    GreateSum=0; 
    for ( i=3;i<8;i++)  
    {  
        sum+=b[i];  
        if (sum<0)  
        {  
            sum=0;  
        }  
        if (sum>GreateSum)  
        {  
            GreateSum=sum;  
        }
    }  
    if (GreateSum==0)  
    {  
        for (int i=3;i<8;i++)  
        {  
            if (GreateSum==0)  
            {  
                GreateSum=b[i];  
            }  
            else  
                if (GreateSum<b[i])  
                {  
                    GreateSum=b[i];  
                }  
        }  
    }
    c[3]=GreateSum;
    //5-9
    sum=0;  
    GreateSum=0; 
    for ( i=4;i<9;i++)  
    {  
        sum+=b[i];  
        if (sum<0)  
        {  
            sum=0;  
        }  
        if (sum>GreateSum)  
        {  
            GreateSum=sum;  
        }
    }  
    if (GreateSum==0)  
    {  
        for (int i=4;i<9;i++)  
        {  
            if (GreateSum==0)  
            {  
                GreateSum=b[i];  
            }  
            else  
                if (GreateSum<b[i])  
                {  
                    GreateSum=b[i];  
                }  
        }  
    }
    c[4]=GreateSum;
    for(i=0;i<5;i++)
    {
        //cout<<c[i]<<"	";
        if(GreateSum<c[i])
        {
            GreateSum=c[i];
        }
    }
    cout<<endl;
    cout<<"最大子数组和的值为："<<GreateSum<<endl;
    return 0;
}

总结：本次试验我收获颇多，在本次试验我充当了导航员的角色，结合前面的几次试验我对结对开发好感很多，1+1>大于2，不管是前期的构思还是中期的代码书写其中又包含了很多，比如代码的书写规范和一些小的算法或者小的技巧，一个给力的小伙伴让我不想学习时也会激励我。当然我们也遇到了很多问题一起解决一起面对，即使解决不了也能乐观一点，互相开开玩笑。