Length of Last Word - LeetCode
题目:
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
.
这道题目一开始以为很简单,后来发现例外还是挺多的。主要的是不能靠普通查找空格来解决。所以这里我们采用了分割字符串的方法,即split函数,要注意的是用空格分割多个空格时,会形成多个“”字符串。
例子:
>>> str = 'a '
>>> str.split(' ')
['a', '', '', '']
所以需要注意这个问题。
代码:
class Solution:
# @param s, a string
# @return an integer
def lengthOfLastWord(self, s):
if not s:
return 0
strlist = s.split(' ')
i = len(strlist)-1
while i>=0:
if strlist[i] != '':
return len(strlist[i])
i-=1
return 0