-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathlastWordCount.cpp
More file actions
42 lines (33 loc) · 1.28 KB
/
lastWordCount.cpp
File metadata and controls
42 lines (33 loc) · 1.28 KB
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
/*
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.
Example:
Given s = "Hello World",
return 5 as length("World") = 5.
Please make sure you try to solve this problem without using library functions. Make sure you only traverse the string once.
*/
enum STATE {START, OUT_WORD, IN_WORD};
int Solution::lengthOfLastWord(const string &A) {
// Do not write main() function.
// Do not read input, instead use the arguments to the function.
// Do not print the output, instead return values as specified
// Still have a doubt. Checkout www.interviewbit.com/pages/sample_codes/ for more details
STATE state = START;
int count = 0;
int last_count = 0;
for (int i = 0; i < A.length(); ++i) {
if (A[i] == ' ') {
if (state == IN_WORD) {
last_count = count;
count = 0;
}
state = OUT_WORD;
} else {
state = IN_WORD;
++count;
}
}
if (state == IN_WORD) last_count = count;
return last_count;
}