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)
{
int prev = 0;
int length = 0;
for (const char* cur = s; *cur != '\0'; cur++)
{
if (*cur == ' ')
{
if (length > 0)
prev = length;
length = 0;
}
else
length++;
}
return length == 0 ? prev : length;
}
};