求数组的概览。逻辑还是很简单的,数组元素一个个比较差值是否为1即可。最先看它给的例子是从0开始,就很天真的用了个for循环,oj后果然错误因为用例可以是负数的。用c写的话用sprintf库函数很方便构造字符串。
如下,for循环的仍然保留只注释掉,以示警戒:
char** summaryRanges(int* nums, int numsSize, int* returnSize) {
char **result = NULL;
int charlength = 30;
result = (char **)malloc(sizeof(char *));
*result = (char *)malloc(sizeof(char) * charlength);
memset(*result, 0, sizeof(char) * charlength);
*returnSize = 0;
int low = 0, high = 0;
bool isIn = false;
int index = 0;
while (index < numsSize) {
if (!isIn) {
low = nums[index];
*returnSize += 1;
sprintf(result[*returnSize - 1], "%d", low);
isIn = true;
}
if (isIn && ((index < numsSize - 1 && (nums[index + 1] - nums[index] != 1)) || index == numsSize - 1)) {
high = nums[index];
if (low != high)
sprintf(result[*returnSize - 1], "%d->%d", low, high);
result = (char **)realloc(result, sizeof(char *) * (*returnSize + 1));
result[*returnSize] = (char *)malloc(sizeof(char) * charlength);
memset(result[*returnSize], 0, sizeof(char) * charlength);
isIn = false;
}
index++;
}
// for (; i <= nums[numsSize - 1]; i++) {
// if (!isIn && i == nums[index]) {
// isIn = true;
// low = i;
// result[*returnSize][0] = low + 48;
// *returnSize += 1;
// }
// if (isIn && i != nums[index]) {
// isIn = false;
// high = i - 1;
// if (low != high) {
// result[*returnSize - 1][1] = '-';
// result[*returnSize - 1][2] = '>';
// result[*returnSize - 1][3] = high + 48;
// result[*returnSize - 1][4] = '\0';
// }
// result = (char **)realloc(result, sizeof(char *) * (*returnSize + 1));
// result[*returnSize] = (char *)malloc(sizeof(char) * charlength);
// memset(result[*returnSize], 0, sizeof(char) * charlength);
// }
// if (isIn)
// index++;
// }
return result;
}