给定一个字符串 s，返回字符串中最后一个单词。
分两步，第一步，从后往前找到一个非空格字符停下。第二步，查找这个单词直到结束
i = len-1
for i>=0 && s[i] == " "
i--
for i>=0 && s[i] != " "
rst=i+rst
func lengthOfLastWord(s string) int {
var rst int
i:=len(s)-1
for i>=0 && s[i] == ' ' {
i--
}
for i>=0 && s[i] != ' ' {
i--
rst++
}
return rst
}
image.png
D140 58. Length of Last Word 题目链接 58. Length of Last Word...
58. Length of Last Word Given a stringsconsists of upper/...
58. Length of Last Word Description Given a string s cons...
Algorithm 58. Length of Last Word Given a string s consis...
分类：SwapLine 时间复杂度: O(n) 58. Length of Last Word Given a s...
Problem Given a string s consists of upper/lower-case alp...
问题描述 Given a string s consists of upper/lower-case alphab...
QuestionGiven a string s consists of upper/lower-case alp...
1.描述 Given a string s consists of upper/lower-case alphab...
Given a string s consists of upper/lower-case alphabets a...
本文标题：58. Length of Last Word
本文链接：https://www.haomeiwen.com/subject/kpevsrtx.html
网友评论