剑指offer-获取数组中子序列之和最大值

/*******************************************************************
Copyright(c) 2016, Tyrone Li
All rights reserved.
*******************************************************************/
// 作者:TyroneLi
//

/*
Q:
    连续子数组的最大和:
        输入一个整型数组,数组中有正数也有负数,数组中一个或者连续多个数组组成一个子数组。求所有子数组
        中的和最大值。
S:
    这里采用动态规划的思想:
        假设f(i)表示第i个数结尾的子数组的最大和,那么要求可以得到如下的递推式:
            f(i) = f(i-1) + data[i], if f(i-1) > 0 && i !=0
            f(i) = data[i]          , if f(i-1) <=0 || i == 0

*/

#include <iostream>
#include <cstdio>
#include <cstdlib>

int getGreatestSumOfSubArr(int*numbers, int length)
{
    if(numbers == nullptr || length <= 0)
        return 0;
    
    int curSum = 0;
    int maxSum = -99999;
    for(int i = 0; i < length; ++i)
    {
        if(curSum <= 0)
        {
            curSum = numbers[i];
        }else{
            curSum += numbers[i];
        }
        if(curSum > maxSum)
            maxSum = curSum;
    }
    return maxSum;
}

void test_1()
{
    std::cout << "Test 1" << std::endl;
    int numbers[] = {1,-2,3,10,-4,7,2,-5};
    std::cout << "Found max_sum = " << getGreatestSumOfSubArr(numbers, 8) << std::endl;
}

void test_2()
{
    std::cout << "Test 2" << std::endl;
    int numbers[] = {-1,-4,-1,-4,-8,-4,-19,-10};
    std::cout << "Found max_sum = " << getGreatestSumOfSubArr(numbers, 8) << std::endl;
}

void test_3()
{
    std::cout << "Test 3" << std::endl;
    int numbers[] = {1,2,5,4,1,7,9,4};
    std::cout << "Found max_sum = " << getGreatestSumOfSubArr(numbers, 8) << std::endl;
}

void test_4()
{
    std::cout << "Test 4" << std::endl;
    int*numbers = nullptr;
    std::cout << "Found max_sum = " << getGreatestSumOfSubArr(numbers, 8) << std::endl;
}

void test_getGreatestSumOfSubArr()
{
    test_1();
    test_2();
    test_3();
    test_4();
}

int main(int argc, char**argv)
{
    test_getGreatestSumOfSubArr();

    return 0;
}
 
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值