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
.
思路:
可以从字符串的最后开始,是空格指针向前值,指到最后一个非空字符。第二个指针从该位置继续向前指,指到第一个空格跳出循环。差值即为所求。
其中注意字符串下标从0 - s.size()(或s.length())。
class Solution {
public:
int lengthOfLastWord(string s) {
int len = s.length();
while(len > -1 && s[len -1] == ' ')
{
len --;
}
int pre = len - 1;
while(pre > -1)
{
if(s[pre] == ' ')
break;
else
pre--;
}
return len - 1 - pre;
}
};
另外:
对于字符串s = “abc”,
s.size() = s.length() = 3;
然而sizeof(s) = 32,这是因为字符串以‘\0’结尾,字符串的每一个char占用一个字节8bit,所以为32.