-
Notifications
You must be signed in to change notification settings - Fork 0
/
58.length-of-last-word.cpp
75 lines (69 loc) · 1.36 KB
/
58.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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
/*
* @lc app=leetcode id=58 lang=cpp
*
* [58] Length of Last Word
*
* https://leetcode.com/problems/length-of-last-word/description/
*
* algorithms
* Easy (38.28%)
* Likes: 1962
* Dislikes: 126
* Total Accepted: 902.7K
* Total Submissions: 2.2M
* Testcase Example: '"Hello World"'
*
* 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.
*
*
*/
// @lc code=start
class Solution {
public:
int lengthOfLastWord(string s) {
int i = s.size() - 1;
while (s[i] == ' ') // skipped trailing zeroes
i--;
int count = 0;
while (i >= 0 and s[i--] != ' ') // counting ending word characters
count++;
return count;
}
};
// @lc code=end