理解了题意以后就很简单了。
class Solution {
public:
int lengthOfLastWord(const char *s) {
if (s == NULL)
return 0;
int n = strlen(s);
int p = n - 1;
while (p >= 0) {
if (s[p] == ' ')
--p;
else
break;
}
if (p == -1)
return 0;
int last = p;
while (p >= 0) {
if (!isAlpha(s[p]))
break;
--p;
}
return last - p;
}
bool isAlpha(char c) {
if (c >= 'a' && c <= 'z')
return true;
if (c >= 'A' && c <= 'Z')
return true;
return false;
}
};
http://oj.leetcode.com/problems/length-of-last-word/