Commit40ad1e9

committed

refactor 1133

1 parent477317d commit40ad1e9Copy full SHA for 40ad1e9

File tree

-22

lines changed

-22

lines changed

Lines changed: 0 additions & 22 deletions

Original file line number	Diff line number	Diff line change
`@@ -2,28 +2,6 @@`
`2`	`2`
`3`	`3`	`importjava.util.TreeMap;`
`4`	`4`
`5`		`-/**`
`6`		`- * 1133. Largest Unique Number`
`7`		`- *`
`8`		`- * Given an array of integers A, return the largest integer that only occurs once.`
`9`		`- * If no integer occurs once, return -1.`
`10`		`- *`
`11`		`- * Example 1:`
`12`		`- * Input: [5,7,3,9,4,9,8,3,1]`
`13`		`- * Output: 8`
`14`		`- * Explanation:`
`15`		`- * The maximum integer in the array is 9 but it is repeated. The number 8 occurs only once, so it's the answer.`
`16`		`- *`
`17`		`- * Example 2:`
`18`		`- * Input: [9,9,8,8]`
`19`		`- * Output: -1`
`20`		`- * Explanation:`
`21`		`- * There is no number that occurs only once.`
`22`		`- *`
`23`		`- * Note:`
`24`		`- * 1 <= A.length <= 2000`
`25`		`- * 0 <= A[i] <= 1000`
`26`		`- * */`
`27`	`5`	`publicclass_1133 {`
`28`	`6`	`publicstaticclassSolution1 {`
`29`	`7`	`publicintlargestUniqueNumber(int[]A) {`

Comments

(0)