LeetCode 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.

题意：判断最后一个单词的长度。

class Solution {
public:
    int lengthOfLastWord(const char *s) {
        int count = 0, last = 0;
        while (*s != '\0') {
            count = (*s == ' ') ? 0 : count+1;
            last = count > 0 ? count : last;
            s++;
        }

        return last;
    }
};

public class Solution {
	    public int lengthOfLastWord(String s) {
	    	int count = 0, ans = 0;
	    	int cur = 0;
	    	for (; cur < s.length(); cur++) {
	    		count = (s.charAt(cur) == ' ') ? 0 : count+1;
	    		ans = count > 0 ? count : ans;
	    	}
	    	
	    	return ans;
	    }
}

LeetCode Length of Last Word

标签：

原文地址：http://blog.csdn.net/u011345136/article/details/44462143