leetcode 数位和相等数对的最大和，为什么我这么写不对呢？-灵析社区

 这个是题目， 这个是我不通过的测试用例：nums = [368,369,307,304,384,138,90,279,35,396,114,328,251,364,300,191,438,467,183] 下面是我的代码： #define _CRT_SECURE_NO_WARNINGS #include #include int sumNumber(int num) { int digit;//用于保存每个位数的数字 int sum = 0;//用于记录每个位数的和 while (num != 0) { digit = num % 10; sum += digit; num /= 10; } return sum; } int maxNum(int* mid) { int i = 0, h = 0, max; int length = 0;//记录数组长度 length = sizeof(mid) / sizeof(mid[0]); printf("\n"); printf("length = %d\n", h); if (mid[0] == 0) max = -1; if (mid[0] !=0 && mid[1] == 0) max = mid[0]; /*if (mid[0] != 0 && mid[1] != 0) { max = mid[0]; for (i = 1; i max) max = mid[i]; } } */ return max; } int maxNumber(int x, int y) { return x > y ? x : y; } int maximumSum(int* nums, int numsSize) { int i = 0, j = 0, h = 0, test = 0, max = 0; int hashTable[100000] = { 0 }; int find = 0; int* res = (int*)calloc(numsSize, sizeof(int)); for (i = 0; i max) max = test; } } }*/ for (i = 0; i max) max = test; } } } if (max == 0) return -1; return max; }