[N-0] refactor 58

Author: fishercoder1534

Diff for: src/main/java/com/fishercoder/solutions/_58.java

@@ -1,25 +1,31 @@
 package com.fishercoder.solutions;
-/**Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string.
-
- If the last word does not exist, return 0.
+/**
+ * 58. Length of Last Word
+ *
+ * Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string.
+ * If the last word does not exist, return 0.
 
  Note: A word is defined as a character sequence consists of non-space characters only.
 
  For example,
  Given s = "Hello World",
- return 5.*/
+ return 5.
+
+ */
 public class _58 {
 
-    public int lengthOfLastWord(String s) {
-        if (s == null || s.length() == 0) {
-            return 0;
-        }
-        s = s.trim();
-        int n = s.length() - 1;
-        while (n >= 0 && s.charAt(n) != ' ') {
-            n--;
+    public static class Solution1 {
+        public int lengthOfLastWord(String s) {
+            if (s == null || s.length() == 0) {
+                return 0;
+            }
+            s = s.trim();
+            int n = s.length() - 1;
+            while (n >= 0 && s.charAt(n) != ' ') {
+                n--;
+            }
+            return s.length() - n - 1;
         }
-        return s.length() - n - 1;
     }
 
 }