반응형
58. Length of Last Word
Given a string s
consisting of some words separated by some number of 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
.
📖문제. 마지막 단어의 길이를 구하시오.
class Solution {
public int lengthOfLastWord(String s) {
String token[] = s.split(" ");
return token[token.length-1].length();
}
}
300x250
'Algorithm > LeetCode' 카테고리의 다른 글
[LeetCode] 371. Sum of Two Integers (두 숫자의 합) (1) | 2022.05.24 |
---|---|
[LeetCode] 35. Search Insert Position (0) | 2022.04.20 |
[LeetCode] 3. Longest Substring Without Repeating Characters (0) | 2022.04.18 |
[LeetCode] 9. Palindrome Number (0) | 2022.04.17 |
[LeetCode] 릿코드 시작하기, Github에 자동 커밋(LeetHub) 방법 (0) | 2022.04.16 |