kniost

谁怕,一蓑烟雨任平生

0%

LeetCode 58. Length of Last Word

58. Length of Last Word

Difficulty: Easy

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:

1
2
Input: "Hello World"
Output: 5

Solution

Language: Java

Beats 80%

1
2
3
4
5
6
7
8
9
10
11
12
13
class Solution {
public int lengthOfLastWord(String s) {
if (s == null || s.length() == 0) {
return 0;
}
s = s.trim();
if (s.length() == 0) {
return 0;
}
String[] arr = s.split(" ");
return arr[arr.length - 1].length();
}
}

Beats 100%

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
class Solution {
public int lengthOfLastWord(String s) {
if (s == null || s.length() == 0) {
return 0;
}
int i = s.length() - 1;
while (i >= 0 && s.charAt(i) == ' ') {
i--;
}
if (i < 0) {
return 0;
}
int end = i;
while (i >= 0 && s.charAt(i) != ' ') {
i--;
}
return end - i;
}
}