Leetcode#58Length of Last Word

标签：character   sequence   example   public   return   

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.

For example, 
Given s = "Hello World",
return 5.

分析，求字符串最后一个单词的长度，需要注意特殊情况，字符串为null的情况

public class Solution {

    public int lengthOfLastWord(String s) {

        String w[]=s.split(" ");

        int l=w.length;

        if(l==0)

            return 0;

        else

            return w[l-1].length();

    }

}

Leetcode#58Length of Last Word

标签：character   sequence   example   public   return   

原文地址：http://7061299.blog.51cto.com/7051299/1640405