g0001_0100.s0058_length_of_last_word.Solution Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java21 Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.38

package g0001_0100.s0058_length_of_last_word;

// #Easy #String #Programming_Skills_II_Day_6 #Udemy_Arrays
// #2023_08_11_Time_0_ms_(100.00%)_Space_40.3_MB_(97.60%)

/**
 * 58 - Length of Last Word\.
 *
 * Easy
 *
 * 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 <= 10⁴
 * *   `s` consists of only English letters and spaces `' '`.
 * *   There will be at least one word in `s`.
**/
public class Solution {
    public int lengthOfLastWord(String s) {
        int len = 0;
        for (int i = s.length() - 1; i >= 0; i--) {
            char ch = s.charAt(i);
            if (ch == ' ' && len > 0) {
                break;
            } else if (ch != ' ') {
                len++;
            }
        }
        return len;
    }
}