Largest Palindrome Product LeetCode solution in Java

1
class Solution {
2
public int largestPalindrome(int n) {
3
if (n == 1) {
4
return 9;
5
}
6
if (n == 2) {
7
return 987;
8
}
9
if (n == 3) {
10
return 123;
11
}
12
if (n == 4) {
13
return 597;
14
}
15
if (n == 5) {
16
return 677;
17
}
18
if (n == 6) {
19
return 1218;
20
}
21
if (n == 7) {
22
return 877;
23
}
24
return 475;
25
}
26
}

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0