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

Sign up
Appearance settings

23. Merge k Sorted Lists #31

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
zwfang merged 3 commits into master from merge-k-sorted-lists
Jan 2, 2019
Merged

23. Merge k Sorted Lists #31

zwfang merged 3 commits into master from merge-k-sorted-lists
Jan 2, 2019

Conversation

Copy link
Collaborator

@zwfang zwfang commented Jan 2, 2019

https://leetcode.com/problems/merge-k-sorted-lists/

Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.

@zwfang zwfang added array An array is stored such that the position of each element can be computed from its index heap(priority queue) a heap is a specialized tree-based data structure which is essentially an almost complete tree Hard Coefficient of difficulty is hard Linked List A Linked list is a linear data structure where each element is a separate object. labels Jan 2, 2019
Copy link

codecov bot commented Jan 2, 2019
edited
Loading

Codecov Report

Merging #31 into master will increase coverage by 0.03%.
The diff coverage is 100%.

Impacted file tree graph

@@ Coverage Diff @@
## master #31 +/- ##
==========================================
+ Coverage 99.22% 99.25% +0.03% 
==========================================
 Files 72 73 +1 
 Lines 1276 1320 +44 
==========================================
+ Hits 1266 1310 +44 
 Misses 6 6 
 Partials 4 4
Impacted Files Coverage Δ
src/0023_merge_k_sorted_lists/mksl.go 100% <100%> (ø)

@zwfang zwfang merged commit 93076b5 into master Jan 2, 2019
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers
No reviews
Assignees
No one assigned
Labels
array An array is stored such that the position of each element can be computed from its index Hard Coefficient of difficulty is hard heap(priority queue) a heap is a specialized tree-based data structure which is essentially an almost complete tree Linked List A Linked list is a linear data structure where each element is a separate object.
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.

1 participant

AltStyle によって変換されたページ (->オリジナル) /