Commit 1467860

committed

Improvement

Signed-off-by: begeekmyfriend <begeekmyfriend@gmail.com>

1 parent eef0996 commit 1467860Copy full SHA for 1467860

File tree

2 files changed

+38

-1

lines changed

0021_merge_two_sorted_lists
- merge_lists.c
0023_merge_k_sorted_lists
- merge_lists.c

2 files changed

+38

-1

lines changed

`‎0021_merge_two_sorted_lists/merge_lists.c‎`

Lines changed: 0 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -10,7 +10,6 @@ static struct ListNode* mergeTwoLists(struct ListNode* l1, struct ListNode* l2)`
`10`	`10`	`{`
`11`	`11`	`struct ListNode dummy;`
`12`	`12`	`struct ListNode *tail = &dummy;`
`13`		`- dummy.next = l1;`
`14`	`13`
`15`	`14`	`while (l1 != NULL && l2 != NULL) {`
`16`	`15`	`if (l1->val <= l2->val) {`

`‎0023_merge_k_sorted_lists/merge_lists.c‎`

Lines changed: 38 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -67,8 +67,45 @@ static void put(struct ListNode *nodes, int size, struct ListNode n)`
`67`	`67`	`build_min_heap(nodes, size);`
`68`	`68`	`}`
`69`	`69`
	`70`	`+static struct ListNode* mergeTwoLists(struct ListNode* l1, struct ListNode* l2)`
	`71`	`+{`
	`72`	`+ struct ListNode dummy;`
	`73`	`+ struct ListNode *tail = &dummy;`
	`74`	`+`
	`75`	`+ while (l1 != NULL && l2 != NULL) {`
	`76`	`+ if (l1->val <= l2->val) {`
	`77`	`+ tail->next = l1;`
	`78`	`+ l1 = l1->next;`
	`79`	`+ } else {`
	`80`	`+ tail->next = l2;`
	`81`	`+ l2 = l2->next;`
	`82`	`+ }`
	`83`	`+ tail = tail->next;`
	`84`	`+ }`
	`85`	`+`
	`86`	`+ tail->next = l1 != NULL ? l1 : l2;`
	`87`	`+`
	`88`	`+ return dummy.next;`
	`89`	`+}`
	`90`	`+`
	`91`	`+static struct ListNode* dfs(struct ListNode** lists, int lo, int hi)`
	`92`	`+{`
	`93`	`+ if (lo > hi) // listsSize might be zero`
	`94`	`+ return NULL;`
	`95`	`+`
	`96`	`+ if (lo == hi)`
	`97`	`+ return lists[lo];`
	`98`	`+`
	`99`	`+ int mid = lo + (hi - lo) / 2;`
	`100`	`+ return mergeTwoLists(dfs(lists, lo, mid), dfs(lists, mid + 1, hi));`
	`101`	`+}`
	`102`	`+`
	`103`	`+`
`70`	`104`	`struct ListNode* mergeKLists(struct ListNode** lists, int listsSize)`
`71`	`105`	`{`
	`106`	`+#if 1`
	`107`	`+ return dfs(lists, 0, listsSize - 1);`
	`108`	`+#else`
`72`	`109`	`int i, size = 0;`
`73`	`110`	`struct ListNode dummy;`
`74`	`111`	`struct ListNode *p = &dummy;`
`@@ -95,6 +132,7 @@ struct ListNode* mergeKLists(struct ListNode** lists, int listsSize)`
`95`	`132`	`}`
`96`	`133`
`97`	`134`	`return dummy.next;`
	`135`	`+#endif`
`98`	`136`	`}`
`99`	`137`
`100`	`138`	`int main(void)`

0 commit comments

Comments

(0)

Navigation Menu

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

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commit 1467860

File tree

2 files changed

2 files changed

`‎0021_merge_two_sorted_lists/merge_lists.c‎`

`‎0023_merge_k_sorted_lists/merge_lists.c‎`

0 commit comments