708. Insert into a Sorted Circular Linked List #351
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
altay9
approved these changes
Jul 3, 2021
Collaborator
altay9
left a comment
altay9
left a comment
There was a problem hiding this comment.
A nice explanation, easy-to-understand solution, and readable code. Thanks, Erdem.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Resolves: #88
Algorithm:
Here, it's best to think about what might occur when we are inserting the value into such a list:
It could be inserted between values. 5 will naturally be inserted after 4 and before 6.
It could be inserted at the end of the list. At the end of the list, the next value is smaller than the previous one. A node would be inserted here if and only if succeeds the largest value or precedes the smallest value.
The algorithm follows from these simple observations.