leetcode_58. Length of Last Word
来源:互联网 发布:淘宝网在线客服 编辑:程序博客网 时间:2024/06/11 01:03
题目: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(string s) { if(s == "") return 0; int last = 0; int i = 0; for(i; i < s.size()-1; ++i){ if(s[i] == ' ' && s[i+1] != ' '){ last = 0; } else if(s[i] != ' '){ ++last; } } if(s[s.size()-1] != ' '){ last++; } return last; }};
0 0
- 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 字符串最后一个单词的长度,字符串分词
- Length of Last Word
- Length of Last Word
- Length of Last Word
- Length of Last Word
- Length of Last Word
- Length of Last Word
- Length of Last Word
- Length of Last Word
- Length of Last Word
- Length of Last Word
- Length of Last Word
- Length of Last Word
- Length of Last Word
- Length of Last Word
- c++多态与接口
- 头文件
- UVALive 3608 Period(DP+二分)
- 零碎知识记录
- Spring整合Struts2的方法
- leetcode_58. Length of Last Word
- SNMP协议详解
- 对无效尝试的思考
- 取模运算
- B1022. D进制的A+B (20)
- 如何使用cmd命令批量打开和关闭不需要的服务
- 《深入理解 Java 虚拟机》- 笔记
- 网络聊天室
- 基于 vue 的单页滚动插件