Commitbdf176e

committed

refactor 1304

1 parent1e4b7e1 commitbdf176eCopy full SHA for bdf176e

File tree

-18

lines changed

-18

lines changed

Lines changed: 0 additions & 18 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,23 +1,5 @@`
`1`	`1`	`packagecom.fishercoder.solutions;`
`2`	`2`
`3`		`-/**`
`4`		`- * 1304. Find N Unique Integers Sum up to Zero`
`5`		`- *`
`6`		`- * Given an integer n, return any array containing n unique integers such that they add up to 0.`
`7`		`- *`
`8`		`- * Example 1:`
`9`		`- * Input: n = 5`
`10`		`- * Output: [-7,-1,1,3,4]`
`11`		`- * Explanation: These arrays also are accepted [-5,-1,1,2,3] , [-3,-1,2,-2,4].`
`12`		`- *`
`13`		`- * Example 2:`
`14`		`- * Input: n = 3`
`15`		`- * Output: [-1,0,1]`
`16`		`- *`
`17`		`- * Example 3:`
`18`		`- * Input: n = 1`
`19`		`- * Output: [0]`
`20`		`- * */`
`21`	`3`	`publicclass_1304 {`
`22`	`4`	`publicstaticclassSolution1 {`
`23`	`5`	`publicint[]sumZero(intn) {`

Comments

(0)