Commitd89febd

committed

refactor 1100

1 parent8dbd447 commitd89febdCopy full SHA for d89febd

File tree

-22

lines changed

-22

lines changed

Lines changed: 0 additions & 22 deletions

Original file line number	Diff line number	Diff line change
`@@ -3,28 +3,6 @@`
`3`	`3`	`importjava.util.HashSet;`
`4`	`4`	`importjava.util.Set;`
`5`	`5`
`6`		`-/**`
`7`		`- * 1100. Find K-Length Substrings With No Repeated Characters`
`8`		`- *`
`9`		`- * Given a string S, return the number of substrings of length K with no repeated characters.`
`10`		`- *`
`11`		`- * Example 1:`
`12`		`- * Input: S = "havefunonleetcode", K = 5`
`13`		`- * Output: 6`
`14`		`- * Explanation:`
`15`		`- * There are 6 substrings they are : 'havef','avefu','vefun','efuno','etcod','tcode'.`
`16`		`- *`
`17`		`- * Example 2:`
`18`		`- * Input: S = "home", K = 5`
`19`		`- * Output: 0`
`20`		`- * Explanation:`
`21`		`- * Notice K can be larger than the length of S. In this case is not possible to find any substring.`
`22`		`- *`
`23`		`- * Note:`
`24`		`- * 1 <= S.length <= 10^4`
`25`		`- * All characters of S are lowercase English letters.`
`26`		`- * 1 <= K <= 10^4`
`27`		`- * */`
`28`	`6`	`publicclass_1100 {`
`29`	`7`	`publicstaticclassSolution1 {`
`30`	`8`	`publicintnumKLenSubstrNoRepeats(StringS,intK) {`

Comments

(0)