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
1 class Solution { 2 public: 3 int lengthOfLastWord(string s) { 4 int len = 0, tail = s.length() - 1; 5 while (tail >= 0 && s[tail] == ‘ ‘) tail--; //过滤掉 “ abb bb ” 后面的空格 6 while (tail >= 0 && s[tail] != ‘ ‘) 7 { 8 len++; 9 tail--; 10 } 11 return len; 12 } 13 14 15 16 };
原文：https://www.cnblogs.com/zle1992/p/10216630.html