A MaxSubseqSum4 (int [], int, int n)
{
int ThisSum;
int i;
ThisSum = = 0;
for (i = 0; i <N; i ++)
{
ThisSum + = a [i];
if (ThisSum>)
= ThisSum;
else if (ThisSum <0)
ThisSum = 0;
}
Return;
}
Data structure - the biggest problem child row
Guess you like
Origin blog.csdn.net/zhaoyananzyn/article/details/98082695
Recommended
Ranking