refactor 258

fishercoder1534 · fishercoder1534 · commit 53ac3365f254 · 2018-11-04T07:23:08.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_258.java b/src/main/java/com/fishercoder/solutions/_258.java
@@ -1,34 +1,17 @@
 package com.fishercoder.solutions;
 
-/**
- * Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.
-
- For example:
-
- Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has only one digit, return it.
-
- Follow up:
- Could you do it without any loop/recursion in O(1) runtime?
-
- Hint:
-
- A naive implementation of the above process is trivial. Could you come up with other methods?
- What are all the possible results?
- How do they occur, periodically or randomly?
- You may find this Wikipedia article: https://en.wikipedia.org/wiki/Digital_root useful.
- * */
-
 public class _258 {
 
-    //only three cases as the code shows
-    public int addDigits(int num) {
-        if (num == 0) {
-            return 0;
+    public static class Solution1 {
+        //only three cases as the code shows
+        public int addDigits(int num) {
+            if (num == 0) {
+                return 0;
+            }
+            if (num % 9 == 0) {
+                return 9;
+            }
+            return num % 9;
         }
-        if (num % 9 == 0) {
-            return 9;
-        }
-        return num % 9;
     }
-
 }
