leetcode-Length of Last Word(2014.3.31)
2014-04-15 19:58
507 查看
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 n=strlen(s)-1;
while(s
&&s
==' ')
n--;
int i=0;
for(;s
&&s
!=' ';n--,i++);
return i;
}
};
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 n=strlen(s)-1;
while(s
&&s
==' ')
n--;
int i=0;
for(;s
&&s
!=' ';n--,i++);
return i;
}
};