leetcode 98. 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.

[Solution]

注意后缀空格。

 1 int lengthOfLastWord(const char *s) 
 2     {
 3         if (s == NULL)
 4             return 0;
 5         int i, length = strlen(s);
 6         
 7         for (i = length - 1; (i >= 0) && (s[i] == ‘ ‘); i--);
 8         length = i;
 9         for (; (i >= 0) && (s[i] != ‘ ‘); i--);
10         
11         return (length - i);
12     }

leetcode 98. Length of Last Word

标签：

原文地址：http://www.cnblogs.com/ym65536/p/4333053.html