feat: add 058

Author: Blankj

README.md

@@ -17,6 +17,7 @@
 |27|[Remove Element][027]|Array, Two Pointers|
 |28|[Implement strStr()][028]|Two Pointers, String|
 |38|[Count and Say][028]|String|
+|58|[Length of Last Word][058]|String|
 
 
 ## Medium
@@ -52,3 +53,4 @@
 [027]: https://github.com/Blankj/awesome-java-leetcode/blob/master/note/027/README.md
 [028]: https://github.com/Blankj/awesome-java-leetcode/blob/master/note/028/README.md
 [038]: https://github.com/Blankj/awesome-java-leetcode/blob/master/note/038/README.md
+[058]: https://github.com/Blankj/awesome-java-leetcode/blob/master/note/058/README.md

note/058/README.md

@@ -0,0 +1,44 @@
+# [Length of Last Word][title]
+
+## Description
+
+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`.
+
+**Tags:** String
+
+
+## 思路
+
+题意是让你从一个只包含大小字母和空格字符的字符串中得到最后一个单词的长度，很简单，我们倒序遍历，先得到最后一个非空格字符的索引，然后再得到它前面的空格字符索引，两者相减即可。当然，我们使用API来完成这件事更加方便，只需一行代码`return s.trim().length()-s.trim().lastIndexOf(" ")-1;`，但我相信作者出这道题的目的肯定不是考你API的使用，所以我们还是用自己的思路来实现。
+
+``` java
+public class Solution {
+    public int lengthOfLastWord(String s) {
+        int p = s.length() - 1;
+        while (p >= 0 && s.charAt(p) == ' ') p--;
+        int end = p;
+        while (p >= 0 && s.charAt(p) != ' ') p--;
+        return end - p;
+    }
+}
+```
+
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我GitHub上的LeetCode题解：[awesome-java-leetcode][ajl]
+
+
+
+[title]: https://leetcode.com/problems/length-of-last-word
+[ajl]: https://github.com/Blankj/awesome-java-leetcode

project/LeetCode/leetcode/src/main/java/com/blankj/easy/_058/Solution.java

@@ -0,0 +1,26 @@
+package com.blankj.easy._058;
+
+/**
+ * <pre>
+ *     author: Blankj
+ *     blog  : http://blankj.com
+ *     time  : 2017/04/21
+ *     desc  :
+ * </pre>
+ */
+
+public class Solution {
+    public int lengthOfLastWord(String s) {
+        int p = s.length() - 1;
+        while (p >= 0 && s.charAt(p) == ' ') p--;
+        int end = p;
+        while (p >= 0 && s.charAt(p) != ' ') p--;
+        return end - p;
+    }
+
+    public static void main(String[] args) {
+        Solution solution = new Solution();
+        System.out.println(solution.lengthOfLastWord("word "));
+        System.out.println(solution.lengthOfLastWord("hello world"));
+    }
+}