Commit8c2b30a

authored

add 211-Design-Add-and-Search-Words-Data-Structure

1 parent1b59ccb commit8c2b30aCopy full SHA for 8c2b30a

File tree

+55

-0

lines changed

+55

-0

lines changed

Lines changed: 55 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,55 @@`
	`1`	`+classTrieNode{`
	`2`	`+constructor(){`
	`3`	`+this.children={};`
	`4`	`+this.endOfWord=false;`
	`5`	`+}`
	`6`	`+}`
	`7`	`+`
	`8`	`+classWordDictionary{`
	`9`	`+constructor(){`
	`10`	`+this.root=newTrieNode();`
	`11`	`+}`
	`12`	`+`
	`13`	`+addWord(word){`
	`14`	`+letcur=this.root;`
	`15`	`+`
	`16`	`+for(constcofword){`
	`17`	`+if(!(cincur.children)){`
	`18`	`+cur.children[c]=newTrieNode();`
	`19`	`+}`
	`20`	`+cur=cur.children[c];`
	`21`	`+}`
	`22`	`+cur.endOfWord=true;`
	`23`	`+}`
	`24`	`+`
	`25`	`+search(word){`
	`26`	`+functiondfs(j,root){`
	`27`	`+letcur=root;`
	`28`	`+`
	`29`	`+for(leti=j;i<word.length;i++){`
	`30`	`+constc=word[i];`
	`31`	`+`
	`32`	`+if(c==="."){`
	`33`	`+for(constkeyincur.children){`
	`34`	`+if(Object.prototype.hasOwnProperty.call(cur.children,key)){`
	`35`	`+constchild=cur.children[key];`
	`36`	`+`
	`37`	`+if(dfs(i+1,child)){`
	`38`	`+returntrue;`
	`39`	`+}`
	`40`	`+}`
	`41`	`+}`
	`42`	`+returnfalse;`
	`43`	`+}else{`
	`44`	`+if(!(cincur.children)){`
	`45`	`+returnfalse;`
	`46`	`+}`
	`47`	`+cur=cur.children[c];`
	`48`	`+}`
	`49`	`+}`
	`50`	`+`
	`51`	`+returncur.endOfWord;`
	`52`	`+}`
	`53`	`+returndfs(0,this.root);`
	`54`	`+}`
	`55`	`+}`

Comments

(0)