Merge pull request gzc426#231 from libihan/libihan-patch-1

gzc426 · web-flow · commit 2fa28f1eeba7 · 2018-12-02T17:04:43.000+08:00
Update libh_leetcode557 and leetcode58
diff --git a/2018.12.2-leetcode557/李碧涵.md b/2018.12.2-leetcode557/李碧涵.md
@@ -0,0 +1,24 @@
+#### [557. Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii/)
+**题目描述**
+> 给定字符串，翻转字符串中每个单词的字符，保留空白和初始的单词顺序。
+
+> 字符串中，单词间用空格分隔，且没有额外的空格。
+
+**例子**
+> Input: "Let's take LeetCode contest"
+Output: "s'teL ekat edoCteeL tsetnoc"
+
+**思想**
+首先split出每个单词。
+**解法**
+```python
+class Solution(object):
+    def reverseWords(self, s):
+        """
+        :type s: str
+        :rtype: str
+        """
+        return ' '.join(map(lambda x:x[::-1], s.split()))
+        # return ' '.join(s.split()[::-1])[::-1]
+        # return ' '.join(s[::-1].split()[::-1])
+```
diff --git a/2018.12.2-leetcode58/李碧涵.md b/2018.12.2-leetcode58/李碧涵.md
@@ -0,0 +1,25 @@
+#### [58. Length of Last Word](https://leetcode.com/problems/length-of-last-word/)
+**题目描述**
+> 给定一个只包含大小写字母或空字符的字符串s，返回字符串中最后一个单词的长度。如果最后一个单词不存在，返回0。
+
+> 单词 - 只包含非空格字符的字符序列。
+
+**例子**
+> Input: "Hello World"
+Output: 5
+
+**思想**
+比较简单。注意：当s只包含空格时的情况
+**解法**
+```python
+class Solution(object):
+    def lengthOfLastWord(self, s):
+        """
+        :type s: str
+        :rtype: int
+        """
+        s = s.split()
+        if not s:
+            return 0
+        return len(s[-1])
+```
