Commit 1b640da

authored

refactor: update ts solution to lc problem: No.0846 (doocs#3074)

1 parent 50b8df8 commit 1b640daCopy full SHA for 1b640da

File tree

+33

-60

lines changed

+33

-60

lines changed

Lines changed: 11 additions & 20 deletions

Original file line number	Diff line number	Diff line change
`@@ -264,36 +264,27 @@ func replaceWords(dictionary []string, sentence string) string {`
`264`	`264`
`265`	`265`	```ts
`266`	`266`	`class Trie {`
`267`		`- privatechildren: Trie[];`
`268`		`- privateref:number;`
	`267`	`+ #children: Record<string, Trie> = {};`
	`268`	`+ #ref=-1;`
`269`	`269`
`270`		`- constructor() {`
`271`		`- this.children = new Array<Trie>(26);`
`272`		`- this.ref = -1;`
`273`		`- }`
`274`		`-`
`275`		`- public insert(w: string, i: number) {`
	`270`	`+ insert(w: string, i: number) {`
`276`	`271`	`let node: Trie = this;`
`277`	`272`	`for (const c of w) {`
`278`		`- const idx = c.charCodeAt(0) - 97;`
`279`		`- if (!node.children[idx]) {`
`280`		`- node.children[idx] = new Trie();`
`281`		`- }`
`282`		`- node = node.children[idx];`
	`273`	`+ node.#children[c] ??= new Trie();`
	`274`	`+ node = node.#children[c];`
`283`	`275`	`}`
`284`		`- node.ref = i;`
	`276`	`+ node.#ref = i;`
`285`	`277`	`}`
`286`	`278`
`287`		`- publicsearch(w: string): number {`
	`279`	`+ search(w: string): number {`
`288`	`280`	`let node: Trie = this;`
`289`	`281`	`for (const c of w) {`
`290`		`- const idx = c.charCodeAt(0) - 97;`
`291`		`- if (!node.children[idx]) {`
	`282`	`+ if (!node.#children[c]) {`
`292`	`283`	`return -1;`
`293`	`284`	`}`
`294`		`- node = node.children[idx];`
`295`		`- if (node.ref !== -1) {`
`296`		`- return node.ref;`
	`285`	`+ node = node.#children[c];`
	`286`	`+ if (node.#ref !== -1) {`
	`287`	`+ return node.#ref;`
`297`	`288`	`}`
`298`	`289`	`}`
`299`	`290`	`return -1;`

Lines changed: 11 additions & 20 deletions

Original file line number	Diff line number	Diff line change
`@@ -251,36 +251,27 @@ func replaceWords(dictionary []string, sentence string) string {`
`251`	`251`
`252`	`252`	```ts
`253`	`253`	`class Trie {`
`254`		`- privatechildren: Trie[];`
`255`		`- privateref:number;`
	`254`	`+ #children: Record<string, Trie> = {};`
	`255`	`+ #ref=-1;`
`256`	`256`
`257`		`- constructor() {`
`258`		`- this.children = new Array<Trie>(26);`
`259`		`- this.ref = -1;`
`260`		`- }`
`261`		`-`
`262`		`- public insert(w: string, i: number) {`
	`257`	`+ insert(w: string, i: number) {`
`263`	`258`	`let node: Trie = this;`
`264`	`259`	`for (const c of w) {`
`265`		`- const idx = c.charCodeAt(0) - 97;`
`266`		`- if (!node.children[idx]) {`
`267`		`- node.children[idx] = new Trie();`
`268`		`- }`
`269`		`- node = node.children[idx];`
	`260`	`+ node.#children[c] ??= new Trie();`
	`261`	`+ node = node.#children[c];`
`270`	`262`	`}`
`271`		`- node.ref = i;`
	`263`	`+ node.#ref = i;`
`272`	`264`	`}`
`273`	`265`
`274`		`- publicsearch(w: string): number {`
	`266`	`+ search(w: string): number {`
`275`	`267`	`let node: Trie = this;`
`276`	`268`	`for (const c of w) {`
`277`		`- const idx = c.charCodeAt(0) - 97;`
`278`		`- if (!node.children[idx]) {`
	`269`	`+ if (!node.#children[c]) {`
`279`	`270`	`return -1;`
`280`	`271`	`}`
`281`		`- node = node.children[idx];`
`282`		`- if (node.ref !== -1) {`
`283`		`- return node.ref;`
	`272`	`+ node = node.#children[c];`
	`273`	`+ if (node.#ref !== -1) {`
	`274`	`+ return node.#ref;`
`284`	`275`	`}`
`285`	`276`	`}`
`286`	`277`	`return -1;`

Lines changed: 11 additions & 20 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,34 +1,25 @@`
`1`	`1`	`class Trie {`
`2`		`- privatechildren: Trie[];`
`3`		`- privateref: number;`
	`2`	`+ #children: Record<string,Trie>={};`
	`3`	`+ #ref=-1;`
`4`	`4`
`5`		`- constructor() {`
`6`		`- this.children = new Array<Trie>(26);`
`7`		`- this.ref = -1;`
`8`		`- }`
`9`		`-`
`10`		`- public insert(w: string, i: number) {`
	`5`	`+ insert(w: string, i: number) {`
`11`	`6`	`let node: Trie = this;`
`12`	`7`	`for (const c of w) {`
`13`		`- const idx = c.charCodeAt(0) - 97;`
`14`		`- if (!node.children[idx]) {`
`15`		`- node.children[idx] = new Trie();`
`16`		`- }`
`17`		`- node = node.children[idx];`
	`8`	`+ node.#children[c] ??= new Trie();`
	`9`	`+ node = node.#children[c];`
`18`	`10`	`}`
`19`		`- node.ref = i;`
	`11`	`+ node.#ref = i;`
`20`	`12`	`}`
`21`	`13`
`22`		`- publicsearch(w: string): number {`
	`14`	`+ search(w: string): number {`
`23`	`15`	`let node: Trie = this;`
`24`	`16`	`for (const c of w) {`
`25`		`- const idx = c.charCodeAt(0) - 97;`
`26`		`- if (!node.children[idx]) {`
	`17`	`+ if (!node.#children[c]) {`
`27`	`18`	`return -1;`
`28`	`19`	`}`
`29`		`- node = node.children[idx];`
`30`		`- if (node.ref !== -1) {`
`31`		`- return node.ref;`
	`20`	`+ node = node.#children[c];`
	`21`	`+ if (node.#ref !== -1) {`
	`22`	`+ return node.#ref;`
`32`	`23`	`}`
`33`	`24`	`}`
`34`	`25`	`return -1;`

Comments

(0)