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

【leetcode】Length of Last Word

时间:2015-07-09 19:22:32      阅读:96      评论: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.

技术分享



public
class Solution { public int lengthOfLastWord(String s) { int length = 0; int i; char[] charArray = s.toCharArray(); i = s.length() - 1; while (i > -1 && charArray[i] == ‘ ‘) { i--; } if (i < 0) { length = 0; } else { for (int index = i; index > -1; index--) { System.out.println(charArray[index]); if (charArray[index] != ‘ ‘) { length++; } else { break; } } } return length; } }

【leetcode】Length of Last Word

标签:

原文地址:http://www.cnblogs.com/six-moon/p/4633788.html

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