首页 > 学院 > 开发设计 > 正文

leetcode 58. Length of Last Word

2019-11-06 06:36:43
字体:
来源:转载
供稿:网友
package com.bupt;//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 result = 0;    	if(s.length() == 0){    		return result;    	}    	char[] input = s.toCharArray();    	int size = input.length-1;    	while(size>=0 && input[size] == ' '){    		size--;    	}    	while(size>=0){    		if(input[size] == ' '){    			break;    		}    		result++;    		size--;    	}        return result;    }        public static void main(String[] args){    	Solution s = new Solution();    	System.out.PRintln(s.lengthOfLastWord(" "));    }}
发表评论 共有条评论
用户名: 密码:
验证码: 匿名发表