题目链接:https://leetcode.com/problems/length-of-last-word/description/
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
题目解析:从后往前扫一遍就可以。
代码如下:0ms Accepted beating 100%
class Solution {
public:
int lengthOfLastWord(string s) {
int len = s.size();
if (len < 1)
return 0;
int i = len - 1;
int cnt = 0;
while (s[i] == ' ')
i--;
while (s[i] != ' ' && i >= 0)
{
cnt++;
i--;
}
return cnt;
}
};
static auto _____ = []() {
std::ios::sync_with_stdio(false);
cin.tie(NULL);
return 0;
}();