refactor 660

fishercoder1534 · fishercoder1534 · commit 926e99510224 · 2020-07-18T06:49:45.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_660.java b/src/main/java/com/fishercoder/solutions/_660.java
@@ -1,20 +1,5 @@
 package com.fishercoder.solutions;
 
-/**
- * 660. Remove 9
- *
- * Start from integer 1, remove any integer that contains 9 such as 9, 19, 29...
-
- So now, you will have a new integer sequence: 1, 2, 3, 4, 5, 6, 7, 8, 10, 11, ...
-
- Given a positive integer n, you need to return the n-th integer after removing. Note that 1 will be the first integer.
-
- Example 1:
- Input: 9
- Output: 10
-
- Hint: n will not exceed 9 x 10^8.
- */
 public class _660 {
 
     public static class Solution1 {
