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.

A word is defined as a character sequence consists of non-space characters only.


Given s = "Hello World", return 5.


This is a simple string processing problem with many ways of solving it. Here we present a simple algorithm.

The idea is to find the start and end index of the last word. Remember the string could have trailing spaces, so the last word doe not necessary ends at the last index of the string.

The Java implementation of the algorithm follows.

public class Solution {
     * @param s A string
     * @return the length of last word
    public int lengthOfLastWord(String s) {
        if(s == null || s.length() == 0)
            return 0;
        int start = -1, end = -1;
        //Scan the string from the end to the beginning
        for(int i = s.length() - 1; i >= 0; i--) {
            //If the current character is a space, we have two choices
            //1. If end is -1, the current character is a trailing space, so ignore
            //2. If end is not -1, then we, found the start of last work, end search
            if(s.charAt(i) == ' ') {
                if(end != -1) {
                    start = i;
            //If current character is not a space, we have two choices
            //1. If end is -1, we found the end index
            //2. If end is not -1, it's part of last word; so keep going
            else {
                if(end == -1) {
                    end = i;
        //If never found the end index, return 0
        if(end == -1)
            return 0;
        return end - start;