Created
February 6, 2017 12:34
-
-
Save cAstraea/5357ba8f10f1b1b93d341a679c072929 to your computer and use it in GitHub Desktop.
break string into substring reccursive solution
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
function breakWord(stringToBreak, dictionary) { | |
if(dictionary.has(stringToBreak)) return stringToBreak; | |
var length = stringToBreak.length; | |
for (var i=1; i < length; i++) { | |
var prefix = stringToBreak.substring(0, i); | |
if(dictionary.has(prefix)) { | |
var sufix = stringToBreak.substring(i, length); | |
var segSufix = breakWord(sufix, dictionary); | |
if(segSufix != null) { | |
return prefix + ' ' + segSufix; | |
} | |
} | |
} | |
return null; | |
} | |
var mySet = new Set(); | |
mySet.add("This"); | |
mySet.add("is"); | |
mySet.add("break"); | |
mySet.add("through"); | |
mySet.add("huge"); | |
mySet.add("breakthrough"); | |
var inputString = "hugebreakthrough"; | |
var result = breakWord(inputString, mySet); | |
console.log(result); |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment