Skip to content

Commit 0d96329

Browse files
add 2nd solution for 1133
1 parent 5ddc852 commit 0d96329

File tree

2 files changed

+19
-0
lines changed

2 files changed

+19
-0
lines changed

src/main/java/com/fishercoder/solutions/_1133.java

Lines changed: 15 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -39,4 +39,19 @@ public int largestUniqueNumber(int[] A) {
3939
return -1;
4040
}
4141
}
42+
43+
public static class Solution2 {
44+
public int largestUniqueNumber(int[] A) {
45+
int[] count = new int[1001];
46+
for (int num : A) {
47+
count[num]++;
48+
}
49+
for (int i = 1000; i >= 0; i--) {
50+
if (count[i] == 1) {
51+
return i;
52+
}
53+
}
54+
return -1;
55+
}
56+
}
4257
}

src/test/java/com/fishercoder/_1133Test.java

Lines changed: 4 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -8,23 +8,27 @@
88

99
public class _1133Test {
1010
private static _1133.Solution1 solution1;
11+
private static _1133.Solution2 solution2;
1112
private static int[] A;
1213

1314
@BeforeClass
1415
public static void setup() {
1516
solution1 = new _1133.Solution1();
17+
solution2 = new _1133.Solution2();
1618
}
1719

1820
@Test
1921
public void test1() {
2022
A = new int[]{5, 7, 3, 9, 4, 9, 8, 3, 1};
2123
assertEquals(8, solution1.largestUniqueNumber(A));
24+
assertEquals(8, solution2.largestUniqueNumber(A));
2225
}
2326

2427
@Test
2528
public void test2() {
2629
A = new int[]{9, 9, 8, 8};
2730
assertEquals(-1, solution1.largestUniqueNumber(A));
31+
assertEquals(-1, solution2.largestUniqueNumber(A));
2832
}
2933

3034
}

0 commit comments

Comments
 (0)