-
Notifications
You must be signed in to change notification settings - Fork 17
/
Copy pathLengthOfLastWord.java
71 lines (60 loc) · 1.71 KB
/
LengthOfLastWord.java
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
package by.andd3dfx.string;
import java.util.regex.Pattern;
/**
* <pre>
* <a href="https://leetcode.com/problems/length-of-last-word/">Task description</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.
* </pre>
*
* @see <a href="https://youtu.be/Kev5TpsfKT4">Video solution</a>
*/
public class LengthOfLastWord {
public int determine(String s) {
s = s.trim();
int spaceIndex = -1;
for (var i = 0; i < s.length(); i++) {
if (s.charAt(i) == ' ') {
spaceIndex = i;
}
}
return s.length() - spaceIndex - 1;
}
public int determineWithoutTrim(String s) {
var right = s.length() - 1;
while (right >= 0 && s.charAt(right) == ' ') {
right--;
}
var left = right;
while (left >= 0 && s.charAt(left) != ' ') {
left--;
}
return right - left;
}
private final static Pattern PATTERN = Pattern.compile("\\w+(?=\\s*$)");
public int determineUsingRegex(String s) {
var matcher = PATTERN.matcher(s);
matcher.find();
return matcher.end() - matcher.start();
}
}