refactor 233

fishercoder1534 · fishercoder1534 · commit e85cbb568c0c · 2020-05-22T10:39:09.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_233.java b/src/main/java/com/fishercoder/solutions/_233.java
@@ -1,16 +1,5 @@
 package com.fishercoder.solutions;
 
-/**
- * 233. Number of Digit One
- *
- * Given an integer n, count the total number of digit 1 appearing in all non-negative integers less than or equal to n.
-
- For example:
- Given n = 13,
- Return 6, because digit 1 occurred in the following numbers: 1, 10, 11, 12, 13.
-
- Hint: Beware of overflow.
- */
 public class _233 {
     public static class Solution1 {
         public int countDigitOne(int n) {
