题目描述
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 {public: int lengthOfLastWord(const char *s) { string str(s); if(str.length()==0) return 0; int len=str.length()-1; while(str[len]==' ' && len>0)//由后向前记录; len--; //记录第一个不为空字符的索引; int start=len; while(str[len]!=' '&& len>=0) len--; //记录第一个为空字符的索引; return start-len; }};