题目链接: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",
return 5.
*
*/
public class LengthOfLastWord {
// 解法一
// 59 / 59 test cases passed.
// Status: Accepted
// Runtime: 208 ms
// Submitted: 0 minutes ago
static int lengthOfLastWord(String s) {
String[] strs = s.split(" ");
if (strs.length == 0) return 0;
else return strs[strs.length - 1].length();
}
// 解法二
// 59 / 59 test cases passed.
// Status: Accepted
// Runtime: 196 ms
// Submitted: 0 minutes ago
static int lengthOfLastWord1(String s) {
int len = 0;
int i = s.length() - 1;
while(i >= 0 && s.charAt(i) == ' ') i --;
for (; i >= 0; i--) {
if(s.charAt(i) != ' ') len ++;
else break;
}
return len;
}
public static void main(String[] args) {
System.out.println(lengthOfLastWord1("a "));
}
}
本文介绍了一种算法,用于确定给定字符串中最后一个非空格字符组成的单词的长度。通过两种不同的方法实现:一种使用split方法分割字符串,另一种则采用逆向遍历的方式寻找最后一个单词。

290

被折叠的 条评论
为什么被折叠?



