首页 > 代码库 > [leetcode]Length of Last Word
[leetcode]Length of Last Word
Length of Last Word
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",
return5.
算法思路：
这道题貌似是leetcode中最easy的一道了吧，心情不好，状态不佳，就找软柿子捏吧
代码如下：
1 public class Solution { 2 public int lengthOfLastWord(String s) { 3 int length = 0; 4 for(int i = s.length() - 1; i >= 0; i--){ 5 if(s.charAt(i) != ‘ ‘){ 6 while(i >= 0 && s.charAt(i) != ‘ ‘){ 7 length++; 8 i--; 9 }10 return length;11 }12 }13 return 0;14 }15 }
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。