Commiteaac0cb

committed

refactor 961

1 parenta8da4ea commiteaac0cbCopy full SHA for eaac0cb

File tree

-27

lines changed

-27

lines changed

Lines changed: 0 additions & 27 deletions

Original file line number	Diff line number	Diff line change
`@@ -3,33 +3,6 @@`
`3`	`3`	`importjava.util.HashSet;`
`4`	`4`	`importjava.util.Set;`
`5`	`5`
`6`		`-/**`
`7`		`- * 961. N-Repeated Element in Size 2N Array`
`8`		`- *`
`9`		`- * In a array A of size 2N, there are N+1 unique elements, and exactly one of these elements is repeated N times.`
`10`		`- *`
`11`		`- * Return the element repeated N times.`
`12`		`- *`
`13`		`- * Example 1:`
`14`		`- *`
`15`		`- * Input: [1,2,3,3]`
`16`		`- * Output: 3`
`17`		`- * Example 2:`
`18`		`- *`
`19`		`- * Input: [2,1,2,5,3,2]`
`20`		`- * Output: 2`
`21`		`- * Example 3:`
`22`		`- *`
`23`		`- * Input: [5,1,5,2,5,3,5,4]`
`24`		`- * Output: 5`
`25`		`- *`
`26`		`- *`
`27`		`- * Note:`
`28`		`- *`
`29`		`- * 4 <= A.length <= 10000`
`30`		`- * 0 <= A[i] < 10000`
`31`		`- * A.length is even`
`32`		`- * */`
`33`	`6`	`publicclass_961 {`
`34`	`7`	`publicstaticclassSolution1 {`
`35`	`8`	`publicintrepeatedNTimes(int[]A) {`

Comments

(0)