Suffix Tree implementation#383
Closed
shaqed wants to merge 2 commits into
Closed
Conversation
christianbender
requested changes
Mar 29, 2018
| public static void main(String[] args) { | ||
| SuffixTree suffixTree = new SuffixTree("senseses$"); | ||
| // Answer is in root, run the debugger to see its children or follow the print below | ||
| Node root = suffixTree.getRoot(); |
There was a problem hiding this comment.
What for a role has this line?
| // Characters match, continue looking | ||
| ans++; | ||
| } else { | ||
| break; |
There was a problem hiding this comment.
That line can be a problem. For example if the first characters don't match but all others are equal the method don't counts it. Because it breaks the loop.
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
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
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.
Hey, I added a SuffixTree implementation inside DataStructures/Trees