Commit210992a

committed

refactor 220

1 parent831289d commit210992aCopy full SHA for 210992a

File tree

-7

lines changed

-7

lines changed

Lines changed: 0 additions & 7 deletions

Original file line number	Diff line number	Diff line change
`@@ -2,13 +2,6 @@`
`2`	`2`
`3`	`3`	`importjava.util.TreeSet;`
`4`	`4`
`5`		`-/**`
`6`		`- * 220. Contains Duplicate III`
`7`		`- *`
`8`		`- * Given an array of integers, find out whether there are two`
`9`		`- * distinct indices i and j in the array such that the difference between nums[i] and nums[j] is at`
`10`		`- * most t and the difference between i and j is at most k.`
`11`		`- */`
`12`	`5`	`publicclass_220 {`
`13`	`6`
`14`	`7`	`publicstaticclassSolution1 {`

Comments

(0)