Length of Last Word
2013-05-15 21:08
302 查看
题目:
Given a string s consists of upper/lower-case alphabets and empty space characters
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 =
return
分析:建立两个指针,刚开始时同时指向第一个字母,然后若是单词,其中一个指针++,若出现了空格后又出现单词,则又同时指向单词的第一个字母。
代码如下:
int lengthOfLastWord(const char *s) {
if(s==NULL) return 0;
int result=0,tmp=0;
bool flag=false;
while(*s!='\0')
{
if(*s==' ')
{
flag=true;
}
else
{
if(flag)
{
flag=false;
result=tmp=0;
}
tmp++;
}
s++;
}
return tmp-result;
}
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.
分析:建立两个指针,刚开始时同时指向第一个字母,然后若是单词,其中一个指针++,若出现了空格后又出现单词,则又同时指向单词的第一个字母。
代码如下:
int lengthOfLastWord(const char *s) {
if(s==NULL) return 0;
int result=0,tmp=0;
bool flag=false;
while(*s!='\0')
{
if(*s==' ')
{
flag=true;
}
else
{
if(flag)
{
flag=false;
result=tmp=0;
}
tmp++;
}
s++;
}
return tmp-result;
}
相关文章推荐
- [LeetCode] Length of Last Word
- Length of Last Word
- LeetCode-Length of Last Word
- Minimum Depth of Binary Tree & Length of Last Word & Trapping Rain Water
- LeetCode Length of Last Word
- LeetCode58:Length of Last Word
- Length of Last Word
- LeetCode Length of Last Word
- leetcode:Length of Last Word
- LeetCode——Length of Last Word
- LeetCode #58 Length of Last Word
- Length of Last Word
- Length of Last Word
- [LeetCode][Java] Length of Last Word
- 3.15 Length of Last Word
- Length of Last Word
- [58] Length of Last Word
- leetcode---length-of-last-word---字符串
- [leetcode]Length of Last Word
- Length of Last Word