标签：tps case char -o tar cas .com character output
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
代码：
class Solution {
public:
int lengthOfLastWord(string s) {
int len = s.length();
int ans = 0;
int temp = 0;
for(int i = len - 1; i >= 0; i --) {
if(s[i] != ‘ ‘) {
temp = i;
break;
}
}
for(int i = temp; i >= 0; i --) {
if(s[i] != ‘ ‘)
ans ++;
else break;
}
return ans;
}
};
#Leetcode# 58. Length of Last Word
标签：tps case char -o tar cas .com character output
原文地址：https://www.cnblogs.com/zlrrrr/p/9908541.html
