【Leetcode】Length of Last Word
2014-05-20 12:10
381 查看
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
View Code
按题意数就可以了..
' ', 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 total_len = strlen(s); if (total_len == 0) return 0; int ret = 0, i = total_len - 1; while (i >= 0 && s[i] == ' ') --i; while (i >= 0 && s[i] != ' ') { ++ret; --i; } return ret; } };
View Code
按题意数就可以了..
相关文章推荐
- LeetCode Online Judge 题目C# 练习 - 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 with Python】 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 21: Length of Last Word
- leetcode 21: Length of Last Word
- leetcode:Length of Last Word
- [Leetcode 3] 58 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