forked from rost0413/LeetCode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathLength_of_Last_Word.cpp
53 lines (45 loc) · 1009 Bytes
/
Length_of_Last_Word.cpp
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
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
/*
Author: Weixian Zhou, ideazwx@gmail.com
Date: Jul 1, 2012
Problem: Length of Last Word
Difficulty: easy
Source: http://www.leetcode.com/onlinejudge
Notes:
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:
simple.
*/
#include <vector>
#include <set>
#include <climits>
#include <algorithm>
#include <iostream>
#include <sstream>
#include <cmath>
#include <cstring>
using namespace std;
class Solution {
public:
int lengthOfLastWord(const char *s) {
if (s == NULL) {
return 0;
}
int i = strlen(s) - 1;
while (i >= 0 && s[i] == ' ') {
i--;
}
int len = 0;
while (i >= 0 && s[i] != ' ') {
len++;
i--;
}
return len;
}
};