LeetCode 58. Length of Last Word

佚名 7年前 (2018-10-18) 算法 739人围观抢沙发百度已收录

分析

难度易

SRE实战互联网时代守护先锋，助力企业售后服务体系运筹帷幄！一键直达领取阿里云限量特价优惠。

来源

https://leetcode.com/problems/length-of-last-word/description/

题目

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.

Example:

Input: "Hello World"

Output: 5

解答

 1 package LeetCode;
 2 
 3 public class L58_LengthOfLastWord {
 4     public int lengthOfLastWord(String s) {
 5         String[] strs;
 6         strs=s.split(" ");
 7         if(strs.length==0)
 8             return 0;
 9         else
10             return strs[strs.length-1].length();
11     }
12 }