首页 > 其他 > 详细

58. Length of Last Word(LeetCode)

时间:2017-07-07 11:18:08      阅读:329      评论:0      收藏:0      [点我收藏+]

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.

 1 class Solution {
 2 public:
 3     int lengthOfLastWord(string s) {
 4         istringstream strcin(s);
 5         string str;
 6         vector<string> str1;
 7         while (strcin >> str)
 8             str1.push_back(str);
 9         if (str1.size() == 0)
10             return 0;
11         else
12             return str1.back().size();
13     }
14 };

 

58. Length of Last Word(LeetCode)

原文:http://www.cnblogs.com/wujufengyun/p/7131041.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!