Leetcode 58 Length of Last Word
来源:互联网 发布:如何测试网络丢包 编辑:程序博客网 时间:2024/06/06 09:42
Question
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.
Answer
int lengthOfLastWord(char* s) { int cnt=0; while(*s!='\0') { if(*s!=' ') cnt++; else if((*s==' ')&&((*(s+1)!='\0')&&(*(s+1)!=' '))) cnt=0; ++s; } return cnt;}
0 0
- [leetcode 58] Length of Last Word
- leetcode-58 Length of Last Word
- Leetcode NO.58 Length of Last Word
- LeetCode #58 length of Last Word
- [LeetCode 58]Length of Last Word
- leetcode || 58、Length of Last Word
- LeetCode 58 Length of Last Word
- [Leetcode 58, easy] Length of Last Word
- Length of Last Word (leetCode 58)
- leetcode[58]:Length of Last Word
- 【leetcode c++】58 Length of Last Word
- leetcode 58:Length of Last Word
- LeetCode---(58)Length of Last Word
- leetcode-58-Length of Last Word
- Leetcode# 58 Length of Last Word
- [leetcode-58]Length of Last Word(c)
- leetcode 58: Length of Last Word
- leetCode #58 Length of Last Word
- Python学习笔记(一):Python中的slice
- 8.10~8.15周题库
- hdu1717小数化分数2
- ImageView中的一些用法
- Java序列化及反序列化 示例讲解
- Leetcode 58 Length of Last Word
- SPOJ COT2 树上的莫队算法,树上区间查询
- Java中Integer直接比较大小
- 菜鸟成长日记-coalesce函数&&collate&&memcache缓存
- myeclipse通过jdbc 连接mysql数据库
- 存储过程&&数据库主从同步
- 把EXCEL用程序导入到ORACLE中(SpringMVC+MyBatis)
- hdu5305 Friends
- HDU 1257 最少拦截系统