分享程序员开发的那些事...
更新时间：2022-10-02 22:57:21
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
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
|
class Solution {
public:
vector<string> stringSplit(string s, const char * split)
{
vector<string> result;
const int sLen = s.length();
char *cs = new char[sLen + 1];
strcpy(cs, s.data());
char *p;
p = strtok(cs, split);
while (p)
{
printf("%s\n", p);
string tmp(p);
result.push_back(tmp);
p = strtok(NULL, split);
}
return result;
}
int lengthOfLastWord(string s) {
if(s.size() == 0)
return 0;
vector<string> words = stringSplit(s," ");
if(words.size() == 0)
return 0;
return words[words.size() - 1].size();
}
}; |
本文转自313119992 51CTO博客，原文链接:http://blog.51cto.com/qiaopeng688/1836629