題目

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) {if(s.length()==0) return 0;char[] chars=s.toCharArray();char empty=' ';int lengthOfLastWord=0;int lengthOfLastWord_temp=0;for(int i=0;i<s.length();i++){if(chars[i]!=empty){lengthOfLastWord++;lengthOfLastWord_temp=lengthOfLastWord;}else {lengthOfLastWord=0;}}if(chars[s.length()-1]==empty) return lengthOfLastWord_temp;else return lengthOfLastWord;} }

代碼下載：https://github.com/jimenbian/GarvinLeetCode

/********************************

* 本文來自博客 ?“李博Garvin“

* 轉載請標明出處:http://blog.csdn.net/buptgshengod

******************************************/

總結

以上是生活随笔為你收集整理的【LeetCode从零单排】No58.Length of Last Word的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。