Last active
August 29, 2015 14:10
-
-
Save blasten/50609b0b4f6a8c0240bb to your computer and use it in GitHub Desktop.
Gets the longest prefix from a string in linear time as in the KMP algorithm
This file contains 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
function longestPrefix(str) { | |
// create a table of size equal to the length of `str` | |
// table[i] will store the prefix of the longest prefix of the substring str[0..i] | |
var table = new Array(str.length); | |
var maxPrefix = 0; | |
// the longest prefix of the substring str[0] has length | |
table[0] = 0; | |
// for the substrings the following substrings, we have two cases | |
for (var i = 1; i < str.length; i++) { | |
// case 1. the current character doesn't match the last character of the longest prefix | |
while (maxPrefix > 0 && str.charAt(i) !== str.charAt(maxPrefix)) { | |
// if that is the case, we have to backtrack, and try find a character that will be equal to the current character | |
// if we reach 0, then we couldn't find a chracter | |
maxPrefix = table[maxPrefix - 1]; | |
} | |
// case 2. The last character of the longest prefix matches the current character in str | |
if (str.charAt(maxPrefix) === str.charAt(i)) { | |
// if that is the case, we know that the longest prefix at position i has one more character. | |
// for example consider `-` be any character not contained in the set [a-c] | |
// str = abc----abc | |
// consider i to be the last character `c` in `str` | |
// maxPrefix = will be 2 (the first `c` in `str`) | |
// maxPrefix now will be 3 | |
maxPrefix++; | |
// so the max prefix for table[9] is 3 | |
} | |
table[i] = maxPrefix; | |
} | |
return table; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment