Commitfbffcce

committed

add a comment for 2156

1 parentc6404c5 commitfbffcceCopy full SHA for fbffcce

File tree

-1

lines changed

-1

lines changed

Lines changed: 3 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -6,6 +6,8 @@ public static class Solution1 {`
`6`	`6`	`* Credit: https://leetcode.com/problems/find-substring-with-given-hash-value/discuss/1730100/Java-rolling-hash(back-to-front)/1242659`
`7`	`7`	`* <p>`
`8`	`8`	`* We start from the right side and compute rolling hash when moving the window of size k towards the left.`
	`9`	`+ * This post explains why we need to start from the right and move towards the left: https://leetcode.com/problems/find-substring-with-given-hash-value/discuss/1730114/C%2B%2B-Rolling-Hash-O(N)-Time`
	`10`	`+ * so that we could use Rabin-Karp algorithm.`
`9`	`11`	`*/`
`10`	`12`	`publicStringsubStrHash(Strings,intpower,intmodulo,intk,inthashValue) {`
`11`	`13`	`longweight =1;`
`@@ -43,6 +45,6 @@ public String subStrHash(String s, int power, int modulo, int k, int hashValue)`
`43`	`45`
`44`	`46`	`returnresult;`
`45`	`47`	`}`
`46`		`-`
`47`	`48`	`}`
	`49`	`+`
`48`	`50`	`}`

Comments

(0)