首页 > 其他 > 详细

Leetcode-Length of Last Word

时间:2014-09-02 21:11:15      阅读:272      评论:0      收藏:0      [点我收藏+]

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.

 

水题

逐字符从后往前扫描遇到空格就返回就行了

 1     public int lengthOfLastWord(String s) {
 2         if(s == null || s.length() ==0){
 3             return  0;
 4         }
 5         s = s.trim();
 6         byte[] sBytes = s.getBytes();
 7         int j= sBytes.length-1;
 8         int total  = 0;
 9         while(j>=0 && sBytes[j] != 32){
10             j --;
11             total ++;
12         }
13         return total;
14     }

 

Leetcode-Length of Last Word

原文:http://www.cnblogs.com/dijkstra-c/p/3952151.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!