[待填坑]LeetCode 23.合并K个升序链表

sanjinjinjin_123

已于 2023-02-16 23:08:57 修改

阅读量51

点赞数

分类专栏：填坑 oj # 链表文章标签：链表 leetcode 数据结构

于 2023-02-16 23:08:08 首次发布

本文链接：https://blog.csdn.net/m0_46472471/article/details/129073768

版权

oj 同时被 3 个专栏收录

5 篇文章 0 订阅

订阅专栏

链表

3 篇文章 0 订阅

订阅专栏

填坑

1 篇文章 0 订阅

订阅专栏

DEBUG

assignment to expression with array type

出错语句：
```
struct ListNode (*ptrs)[listsSize];
for (int i=0; i<listsSize; i++) ptrs[i] = lists[i];
```
区分数组指针与指针数组：
待填坑！！！

代码

1.顺序找最小值

struct ListNode *min_node(struct ListNode **ptr_ptrs, int listsSize)
{
    struct ListNode *res = NULL;
    int min_idx = -1;
    for (int i=0;i<listsSize;i++){
        if (ptr_ptrs[i] != NULL){
            if (res == NULL) {
                res = ptr_ptrs[i];
                min_idx = i;
            }
            else {
                res = res->val > ptr_ptrs[i]->val ? ptr_ptrs[i] : res;
                if (res == ptr_ptrs[i]) min_idx = i;
                }
        }
    }
    // if (res != NULL) for(int i=0;i<listsSize;i++){
    //     if (ptr_ptrs[i] == res)
    //         ptr_ptrs[i]=res->next;
    // }
    //printf ("min_idx=%d\n", min_idx);
    if (min_idx > -1) ptr_ptrs[min_idx] = res->next;
    //printf("res:%p\n", res);
    return res;
}

struct ListNode* mergeKLists(struct ListNode** lists, int listsSize){
    if (listsSize == 0) return NULL;
    if (listsSize == 1 && lists[0] == NULL) return NULL;

    struct ListNode *ptrs[listsSize];
    for (int i=0; i<listsSize; i++) ptrs[i] = lists[i];
    struct ListNode *dummy = malloc (sizeof(struct ListNode));
    struct ListNode *p = dummy;
    struct ListNode *temp;
    while ((temp = min_node(ptrs, listsSize)) != NULL){
        //printf("temp=%p\n", temp);
        p->next = temp;
        p=p->next;
        //printf("p.val=%d\n", p->val);
    }
    p->next = NULL;
    return dummy->next;
}