File tree 2 files changed +4
-4
lines changed
2 files changed +4
-4
lines changed Original file line number Diff line number Diff line change @@ -239,9 +239,9 @@ int q_descend(struct list_head *head);
239
239
* This function merge the second to the last queues in the chain into the first
240
240
* queue. The queues are guaranteed to be sorted before this function is called.
241
241
* No effect if there is only one queue in the chain. Allocation is disallowed
242
- * in this function. There is no need to free the 'qcontext_t ' and its member
243
- * 'q' since they will be released externally. However, q_merge() is responsible
244
- * for making the queues to be NULL-queue, except the first one.
242
+ * in this function. There is no need to free the 'queue_contex_t ' and its
243
+ * member 'q' since they will be released externally. However, q_merge() is
244
+ * responsible for making the queues to be NULL-queue, except the first one.
245
245
*
246
246
* Reference:
247
247
* https://leetcode.com/problems/merge-k-sorted-lists/
Original file line number Diff line number Diff line change 1
- fc83d2142cdebd29bf8dbf01d2c21c59f8c6a7ce queue.h
1
+ 444bab14cb8ad4c949f61b3c10a22a3ed2401425 queue.h
2
2
3337dbccc33eceedda78e36cc118d5a374838ec7 list.h
You can’t perform that action at this time.
0 commit comments