/*******************************************************************
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;
}
剑指offer-获取数组中子序列之和最大值
最新推荐文章于 2020-07-08 23:14:00 发布