refactor 479

fishercoder1534 · fishercoder1534 · commit 162fa20b2b44 · 2020-07-13T06:20:33.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_479.java b/src/main/java/com/fishercoder/solutions/_479.java
@@ -1,20 +1,5 @@
 package com.fishercoder.solutions;
 
-/**
- * 479. Largest Palindrome Product
- *
- * Find the largest palindrome made from the product of two n-digit numbers.
- Since the result could be very large, you should return the largest palindrome mod 1337.
-
- Example:
- Input: 2
- Output: 987
-
- Explanation: 99 x 91 = 9009, 9009 % 1337 = 987
-
- Note:
- The range of n is [1,8].
- */
 public class _479 {
     public static class Solution1 {
         /**
