【LeetCode】58 - Length of Last Word

标签：

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         int n=s.size()-1;
 5         while(n>=0&&s.at(n)&&s.at(n)==‘ ‘)n--;
 6         int i=0;
 7         
 8         for(;n>=0&&s.at(n)&&s.at(n)!=‘ ‘;n--,i++);
 9         return i;
10     }
11 };

【LeetCode】58 - Length of Last Word

标签：

原文地址：http://www.cnblogs.com/irun/p/4681491.html