Commit8b10358

committed

refactor 209

1 parente42ecee commit8b10358Copy full SHA for 8b10358

File tree

-16

lines changed

-16

lines changed

Lines changed: 0 additions & 16 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,21 +1,5 @@`
`1`	`1`	`packagecom.fishercoder.solutions;`
`2`	`2`
`3`		`-/**`
`4`		`- * 209. Minimum Size Subarray Sum`
`5`		`- *`
`6`		`- * Given an array of n positive integers and a positive integer s,`
`7`		`- * find the minimal length of a contiguous subarray of which the sum ≥ s.`
`8`		`- * If there isn't one, return 0 instead.`
`9`		`-`
`10`		`- For example, given the array [2,3,1,2,4,3] and s = 7,`
`11`		`- the subarray [4,3] has the minimal length under the problem constraint.`
`12`		`-`
`13`		`- click to show more practice.`
`14`		`-`
`15`		`- More practice:`
`16`		`- If you have figured out the O(n) solution,`
`17`		`- try coding another solution of which the time complexity is O(n log n).`
`18`		`- */`
`19`	`3`	`publicclass_209 {`
`20`	`4`
`21`	`5`	`publicstaticclassSolution1 {`

Comments

(0)