Commitf0d0d56

committed

update: 28

1 parentbb26128 commitf0d0d56Copy full SHA for f0d0d56

File tree

+37

-0

lines changed

+37

-0

lines changed

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -26,6 +26,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr`
`26`	`26`	`\|22\|[Generate Parentheses](https://leetcode.com/problems/generate-parentheses/)\|[JavaScript](./src/generate-parentheses/res.js)\|Medium\|`
`27`	`27`	`\|26\|[Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/)\|[JavaScript](./src/remove-duplicates-from-sorted-array/res.js)\|Easy\|`
`28`	`28`	`\|27\|[Remove Element](https://leetcode.com/problems/remove-element/)\|[JavaScript](./src/remove-element/res.js)\|Easy\|`
	`29`	`+\|28\|[Implement strStr()](https://leetcode.com/problems/implement-strstr/)\|[JavaScript](./src/implement-strstr/res.js)\|Easy\|`
`29`	`30`	`\|29\|[Divide Two Integers](https://leetcode.com/problems/divide-two-integers/)\|[JavaScript](./src/divide-two-integers/res.js)\|Medium\|`
`30`	`31`	`\|33\|[Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)\|[JavaScript](./src/search-in-rotated-sorted-array/res.js)\|Medium\|`
`31`	`32`	`\|34\|[Search for a Range](https://leetcode.com/problems/search-for-a-range/)\|[JavaScript](./src/search-for-a-range/res.js)\|Medium\|`

Lines changed: 36 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,36 @@`
	`1`	`+/**`
	`2`	`+ * KMP`
	`3`	`+ *@param {string} haystack`
	`4`	`+ *@param {string} needle`
	`5`	`+ *@return {number}`
	`6`	`+ */`
	`7`	`+varstrStr=function(haystack,needle){`
	`8`	`+consthlen=haystack.length;`
	`9`	`+constnlen=needle.length;`
	`10`	`+if(!nlen)return0;`
	`11`	`+if(!hlen)return-1;`
	`12`	`+`
	`13`	`+letFSM=newArray(nlen);`
	`14`	`+letX=0,match=0;`
	`15`	`+for(leti=0;i<nlen;i++){`
	`16`	`+match=needle[i].charCodeAt();`
	`17`	`+FSM[i]=newArray(256);`
	`18`	`+for(letj=0;j<256;j++){`
	`19`	`+FSM[i][j]=FSM[X][j]\|\|0;`
	`20`	`+}`
	`21`	`+`
	`22`	`+FSM[i][match]=i+1;`
	`23`	`+if(i>0){`
	`24`	`+X=FSM[X][match];`
	`25`	`+}`
	`26`	`+}`
	`27`	`+`
	`28`	`+letstate=0;`
	`29`	`+for(leti=0;i<hlen;i++){`
	`30`	`+state=FSM[state][haystack[i].charCodeAt()];`
	`31`	`+if(state===nlen){`
	`32`	`+returni-nlen+1;`
	`33`	`+}`
	`34`	`+}`
	`35`	`+return-1;`
	`36`	`+};`

Comments

(0)