-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path58_length_of_last_word.cpp
More file actions
71 lines (57 loc) · 1.49 KB
/
58_length_of_last_word.cpp
File metadata and controls
71 lines (57 loc) · 1.49 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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
#include <bits/stdc++.h>
using namespace std;
class Solution {
public:
int lengthOfLastWord(string s) {
int len = s.length() - 1;
int lastWordLength = 0;
while (len >= 0 && s[len] == ' ') {
--len;
}
while (len >= 0 && s[len] != ' ') {
++lastWordLength;
--len;
}
return lastWordLength;
}
};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
string str = " fly me to the moon ";
Solution solve;
int result = solve.lengthOfLastWord(str);
cout << result << '\n';
return 0;
}
/*
------------------
Problem Statement:
------------------
Given a string s consisting of words and spaces, return the length of the last word in the string.
A word is a maximal substring consisting of non-space characters only.
----------
Example 1:
----------
Input: s = "Hello World"
Output: 5
Explanation: The last word is "World" with length 5.
----------
Example 2:
----------
Input: s = " fly me to the moon "
Output: 4
Explanation: The last word is "moon" with length 4.
----------
Example 3:
----------
Input: s = "luffy is still joyboy"
Output: 6
Explanation: The last word is "joyboy" with length 6.
------------
Constraints:
------------
1 <= s.length <= 10^4
s consists of only English letters and spaces ' '.
There will be at least one word in s.
*/