本文主要是介绍Length of Last Word - LeetCode,希望对大家解决编程问题提供一定的参考价值,需要的开发者们随着小编来一起学习吧!
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
.
>>> str = 'a '
>>> str.split(' ')
['a', '', '', '']
所以需要注意这个问题。
代码:
class Solution:# @param s, a string# @return an integerdef lengthOfLastWord(self, s):if not s:return 0strlist = s.split(' ')i = len(strlist)-1while i>=0:if strlist[i] != '':return len(strlist[i])i-=1return 0
这篇关于Length of Last Word - LeetCode的文章就介绍到这儿,希望我们推荐的文章对编程师们有所帮助!