-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path58_Length_of_Last_Word.swift
More file actions
71 lines (53 loc) · 1.56 KB
/
58_Length_of_Last_Word.swift
File metadata and controls
71 lines (53 loc) · 1.56 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
/*
Done 15.06.2025. Revisited: N/A
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 <= 104
s consists of only English letters and spaces ' '.
There will be at least one word in s.
*/
import Foundation
class P58 {
// MARK: - Option 1. Time: O(?). Memory: O(?)
func lengthOfLastWord(_ s: String) -> Int {
return s.split(separator: " ").last?.count ?? 0
}
// MARK: - Option 2. Time: O(?). Memory: O(?)
func lengthOfLastWord2(_ s: String) -> Int {
var length = 0
for ch in s.trimmingCharacters(in: .whitespaces).reversed() {
if ch == " " {
return length
} else {
length += 1
}
}
return length
}
// MARK: - Option 3 - neetcode. Time: O(n). Memory: O(1)
func lengthOfLastWord3(_ s: String) -> Int {
var length = 0
var index = s.count - 1
while s[index] == " " {
index -= 1
}
while index >= 0 && s[index] != " " {
length += 1
index -= 1
}
return length
}
}