58. Length of Last Word
https://leetcode.com/problems/length-of-last-word/
---
Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word (last word means the last appearing word if we loop from left to right) in the string.
If the last word does not exist, return 0.
Note: A word is defined as a maximal substring consisting of non-space characters only.
Example:
Input: "Hello World" Output: 5
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| class Solution { | |
| public int lengthOfLastWord(String s) { | |
| int len = 0; | |
| s = s.trim(); | |
| for (int i = s.length() - 1; i >=0; i--) { | |
| if (s.charAt(i) == ' ') { | |
| return len; | |
| } else { | |
| len++; | |
| } | |
| } | |
| return len; | |
| } | |
| } |
