面试题42: 连续子数组的最大和
题目:输入一个整型数组,数组里有正数也有负数。数组中的一个或连续多个整数组成一个子数组。求所有子数组的和的最大值。要求时间复杂度为O(n)。
解法一:
int FindGreatestSumOfSubArray(int* pData, int nLength) {
if ((pData == nullptr) || (nLength < 0)) {
return 0;
}
int nCurSum = 0;
int nGreatestSum = 0x80000000;
for (int i = 0; i < nLength; ++i) {
if (nCurSum <= 0) {
nCurSum = pData[i];
}
else {
nCurSum += pData[i];
}
if (nCurSum > nGreatestSum) {
nGreatestSum = nCurSum;
}
}
return nGreatestSum;
}
解法二:
解题思路:
采取动态规划的办法:
f
(
i
)
=
{
p
D
a
t
a
[
i
]
,
i = 0 or f(i-1) ≤ 0
f
(
i
−
1
)
+
p
D
a
t
a
[
i
]
,
i != 0 and f(i-1) ≤ 0
f(i)= \begin{cases} pData[i], & \text {i = 0 or f(i-1) ≤ 0 } \\ f(i-1)+pData[i], & \text{i != 0 and f(i-1) ≤ 0 }\end{cases}
f(i)={pData[i],f(i−1)+pData[i],i = 0 or f(i-1) ≤ 0 i != 0 and f(i-1) ≤ 0
// f(i)表示以数字i结尾的子数组的最大和
// 求f(0) ~ f(n-1)的最大值