LeetCode Notes_#58 Length of Last Word

LeetCode Notes_#58 Length of Last Word

LeetCode 

Contents

• 题目
• 思路和解答
  • 思路
  • 解答

题目

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.

Example:

Input: "Hello World"
Output: 5

思路和解答

思路

感觉比较简单，先使用‘ ’作为分隔符将所有词分隔开，然后得到最后一个词语，返回他的长度

解答

a='hello bupt and world'
print (a.split(' ')[-1])

world

b='a '
c=b.split(' ')
c.remove('')
print(c)

['a']

class Solution(object):
    def lengthOfLastWord(self, s):
        """
        :type s: str
        :rtype: int
        """
        if len(s)==0:
            return 0
        tmp=s.split(' ')
        while '' in tmp:
            tmp.remove('')
        if len(tmp)==0:
            return 0
        return len(tmp[-1])

20ms,beat 99.37%

感觉是因为用了python的方法所以很简单，用其他语言的话split()的功能可能要自己去实现