A pull request from cx #164
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
…ns cannot perfectly cover the states_needed.
…ce.py is completed. And the 02_longest_common_substring.py is added.
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.
There are three changes in this pull request.
First, the original code in 08_greedy_algorithms/python/01_set_covering.py did not consider the exit condition when the stations cannot perfectly cover the states_needed.
Second, the code in 09_dynamic_programming/python/01_longest_common_subsequence.py is completed.
Finally, the 02_longest_common_substring.py is added to 09_dynamic_programming/python.
:)