您的位置:首页 > 其它

LEETCODE: Length of Last Word

2014-12-20 18:19 316 查看
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 length = strlen(s);
int ii = length - 1;
while(ii >= 0) {
if(*(s + ii) == ' ')
ii --;
else
break;
}

int lastlength = 0;
while(ii >= 0) {
if(*(s + ii) != ' ') {
lastlength ++;
ii --;
}
else
break;
}

return lastlength;
}
};
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签:  LEETCODE 算法 string