[88][E][leetcode 题解]Length of Last Word

最新推荐文章于 2025-12-04 22:56:41 发布

原创最新推荐文章于 2025-12-04 22:56:41 发布 · 387 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#python #leetcode

leetcode 同时被 2 个专栏收录

175 篇文章

订阅专栏

算法

157 篇文章

订阅专栏

本文介绍了一个Python函数，用于计算给定字符串中最后一个单词的长度。该函数通过将字符串转换为列表并反转来实现，然后遍历列表以找到第一个非空字符的位置，从而确定最后一个单词的长度。

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.

class Solution(object):
    def lengthOfLastWord(self, s):
        s = list(s)
        if len(s) == 0:
            return 0

        s.reverse()
        #print s

        while len(s) > 0 and s[0] == ' ':
            s = s[1:]
        try:
            pos = s.index(' ')
        except:
            return len(s)
        return pos
        """
        :type s: str
        :rtype: int
        """