void getMaxChildBuf(char *str, int length)
{
int i = 0;
int sum = 0;
int tmp = 0;
for(i = 0; i < length; i++)
{
sum += str[i];
if(sum > tmp)
{
tmp = sum;
}
if(sum < 0)
{
sum = 0;
}
}
printf("result = %d\n", tmp);
}
int main()
{
char buf[] = {1,-2,3,10,-4,7,2,-5};
getMaxChildBuf(buf, 8);
return 0;
}
子数组最大和
最新推荐文章于 2022-04-18 20:15:35 发布