refactor 738

fishercoder1534 · fishercoder1534 · commit cc3ee31b0b4f · 2020-07-22T12:45:31.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_738.java b/src/main/java/com/fishercoder/solutions/_738.java
@@ -1,25 +1,5 @@
 package com.fishercoder.solutions;
 
-/**
- * 738. Monotone Increasing Digits
- *
- * Given a non-negative integer N, find the largest number that is less than or equal to N with monotone increasing digits.
- * (Recall that an integer has monotone increasing digits if and only if each pair of adjacent digits x and y satisfy x <= y.)
-
- Example 1:
- Input: N = 10
- Output: 9
-
- Example 2:
- Input: N = 1234
- Output: 1234
-
- Example 3:
- Input: N = 332
- Output: 299
-
- Note: N is an integer in the range [0, 10^9].
- */
 public class _738 {
     public static class Solution1 {
         /**
