码迷,mamicode.com
首页 > 其他好文 > 详细

LeetCode 58. Length of Last Word

时间:2018-10-18 10:54:24      阅读:144      评论:0      收藏:0      [点我收藏+]

标签:cte   ase   ast   define   and   lse   turn   ems   ali   

分析

难度 易

来源

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 }

 

 

LeetCode 58. Length of Last Word

标签:cte   ase   ast   define   and   lse   turn   ems   ali   

原文地址:https://www.cnblogs.com/flowingfog/p/9808407.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!