Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
45 lines (40 loc) · 998 Bytes

File metadata and controls

45 lines (40 loc) · 998 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
//
// Solution23.hpp
// Algorithm
//
// Created by Pancf on 2020/10/12.
// Copyright © 2020 Pancf. All rights reserved.
//
#ifndef Solution23_hpp
#define Solution23_hpp
#include <stdio.h>
#include <vector>
/**
* Definition for singly-linked list.
*/
struct ListNode {
int val;
ListNode *next;
ListNode() : val(0), next(nullptr) {}
ListNode(int x) : val(x), next(nullptr) {}
ListNode(int x, ListNode *next) : val(x), next(next) {}
};
class Solution23 {
public:
ListNode* mergeKLists(std::vector<ListNode*>& lists);
static void test()
{
ListNode node3{5};
ListNode node2{4, &node3};
ListNode node1{1, &node2};
ListNode node6{4};
ListNode node5{3, &node6};
ListNode node4{1, &node5};
ListNode node8{6};
ListNode node7{2, &node8};
Solution23 s;
std::vector<ListNode *> lists{&node1, &node4, &node7};
auto res = s.mergeKLists(lists);
}
};
#endif /* Solution23_hpp */
Morty Proxy This is a proxified and sanitized view of the page, visit original site.