ID | Title | Difficulty | |
---|---|---|---|
Loading... |
58. Length of Last Word
Easy
LeetCode
String
Problem
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:
Input: "Hello World"
Output: 5
Code
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--;
}
int count = 0;
while(i >= 0 && s.charAt(i) != ' '){
i--;
count++;
}
return count;
}
}
按 <- 键看上一题!
57. Insert Interval
按 -> 键看下一题!
59. Spiral Matrix II