[LeetCode] Length of Last Word
2014-03-09 22:39
405 查看
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
Solution:
' ', 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.
Solution:
class Solution { public: int lengthOfLastWord(const char *s) { int len = 0; while(s[len] != '\0') len++; if(len == 0) return 0; int start = len - 1, end = len - 1; while(end >= 0 && s[end] == ' ') end--; if(end < 0) return 0; start = end - 1; while(start >= 0 && s[start] != ' ') start--; return end - start; } };
相关文章推荐
- leetcode 58:Length of Last Word
- 【leetcode】【58】Length of Last Word
- 【LeetCode】 Length Of LastWord
- LeetCode(48)-Length of Last Word
- LeetCode - Length of Last Word
- leetcode Length of Last Word
- Leetcode: Length of Last Word
- LeetCode-Easy刷题(12) Length of Last Word
- Leetcode 58 - Length of Last Word
- leetcode解题方案--058--Length of Last Word
- [LeetCode] Length of Last Word
- Leetcode | Length of Last Word
- [leetcode]Length of Last Word
- leetcode: 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
- LeetCode58——Length of Last Word
- LeetCode---(58)Length of Last Word