#228 汇总区间

最新推荐文章于 2024-07-17 00:04:32 发布

sdlkjaljafdg

最新推荐文章于 2024-07-17 00:04:32 发布

阅读量88

点赞数

分类专栏： LeetCode刷题

本文链接：https://blog.csdn.net/Haku_yyf/article/details/116572538

版权

LeetCode刷题专栏收录该内容

125 篇文章 1 订阅

订阅专栏

/**
 * Note: The returned array must be malloced, assume caller calls free().
 */
char ** summaryRanges(int* nums, int numsSize, int* returnSize){
    int i;
    *returnSize = 0;
    char **result = (char **)malloc(sizeof(char *) * numsSize);
    for(i = 0; i<numsSize; ++i)
    {
        int low = nums[i];
        i++;
        while(i<numsSize && nums[i] == nums[i-1] + 1) i++;
        i--;
        int high = nums[i];
        char *tmp = (char *)malloc(sizeof(char) * 25);
        sprintf(tmp, "%d", low);
        if(low<high)
        {
          sprintf(tmp + strlen(tmp), "->");
          sprintf(tmp + strlen(tmp), "%d", high);  
        }
        result[(*returnSize)++] = tmp;
    }
    return result;
}