子数组和最大值

/*求子数组的最大和*/int maxSum(int *arr, int len){int sum, max;sum = max = arr[0];for (int i = 1; i < len; ++i){if (sum <= 0)sum = arr[i];elsesum += arr[i];if (sum > max)max = sum;}return max;}