Commit74579b5

committed

refactor 1207

1 parent9e90e95 commit74579b5Copy full SHA for 74579b5

File tree

-23

lines changed

-23

lines changed

Lines changed: 0 additions & 23 deletions

Original file line number	Diff line number	Diff line change
`@@ -6,29 +6,6 @@`
`6`	`6`	`importjava.util.Map;`
`7`	`7`	`importjava.util.Set;`
`8`	`8`
`9`		`-/**`
`10`		`- * 1207. Unique Number of Occurrences`
`11`		`- *`
`12`		`- * Given an array of integers arr,`
`13`		`- * write a function that returns true if and only if the number of occurrences of each value in the array is unique.`
`14`		`- *`
`15`		`- * Example 1:`
`16`		`- * Input: arr = [1,2,2,1,1,3]`
`17`		`- * Output: true`
`18`		`- * Explanation: The value 1 has 3 occurrences, 2 has 2 and 3 has 1. No two values have the same number of occurrences.`
`19`		`- *`
`20`		`- * Example 2:`
`21`		`- * Input: arr = [1,2]`
`22`		`- * Output: false`
`23`		`- *`
`24`		`- * Example 3:`
`25`		`- * Input: arr = [-3,0,1,-3,1,1,1,-3,10,0]`
`26`		`- * Output: true`
`27`		`- *`
`28`		`- * Constraints:`
`29`		`- * 1 <= arr.length <= 1000`
`30`		`- * -1000 <= arr[i] <= 1000`
`31`		`- * */`
`32`	`9`	`publicclass_1207 {`
`33`	`10`	`publicstaticclassSolution1 {`
`34`	`11`	`publicbooleanuniqueOccurrences(int[]arr) {`

Comments

(0)