Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit162fa20

Browse files
refactor 479
1 parentc6a0f44 commit162fa20

File tree

1 file changed

+0
-15
lines changed
  • src/main/java/com/fishercoder/solutions

1 file changed

+0
-15
lines changed

‎src/main/java/com/fishercoder/solutions/_479.java

Lines changed: 0 additions & 15 deletions
Original file line numberDiff line numberDiff line change
@@ -1,20 +1,5 @@
11
packagecom.fishercoder.solutions;
22

3-
/**
4-
* 479. Largest Palindrome Product
5-
*
6-
* Find the largest palindrome made from the product of two n-digit numbers.
7-
Since the result could be very large, you should return the largest palindrome mod 1337.
8-
9-
Example:
10-
Input: 2
11-
Output: 987
12-
13-
Explanation: 99 x 91 = 9009, 9009 % 1337 = 987
14-
15-
Note:
16-
The range of n is [1,8].
17-
*/
183
publicclass_479 {
194
publicstaticclassSolution1 {
205
/**

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp