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.

 Note: A word is defined as a character sequence consists of non-space characters only.

 For example,
 Given s = "Hello World",
 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--;
        }
        return s.length() - n - 1;
    }

}

@@ -31,16 +31,50 @@
 ons;%0A/**
+%0A * 58. Length of Last Word%0A *%0A * 
 Given a 
@@ -199,17 +199,18 @@
 string.%0A
-%0A
+ *
  If the 
@@ -385,16 +385,19 @@
 eturn 5.
+%0A%0A 
 */%0Apubli
@@ -411,16 +411,56 @@
  _58 %7B%0A%0A
+    public static class Solution1 %7B%0A    
     publ
@@ -503,16 +503,20 @@
         
+   
+ 
 if (s ==
@@ -551,24 +551,28 @@
             
+    
 return 0;%0A  
@@ -577,26 +577,32 @@
         
-%7D%0A
+    %7D%0A  
         
 s = s.tr
@@ -593,16 +593,18 @@
         
+  
 s = s.tr
@@ -609,16 +609,20 @@
 trim();%0A
+    
         
@@ -653,16 +653,20 @@
         
+    
 while (n
@@ -708,16 +708,20 @@
         
+ 
+   
 n--;%0A   
@@ -717,34 +717,42 @@
    n--;%0A        
-%7D%0A
+    %7D%0A    
         return s
@@ -766,21 +766,31 @@
 () - n - 1;%0A
+        %7D%0A
     %7D%0A%0A%7D%0A

refactor 58