58. Length of Last Word（LeetCode）

标签：for   string   length   tor   blog   note   ast   etc   div   

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）

标签：for   string   length   tor   blog   note   ast   etc   div   

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