leetCode 58. Length of Last Word 字符串

58. 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:
    vector<string> stringSplit(string s, const char * split)
    {
        vector<string> result;
        const int sLen = s.length();
        char *cs = new char[sLen + 1];
        strcpy(cs, s.data());
        char *p;
     
        p = strtok(cs, split);
        while (p)
        {
            printf("%s\n", p);
            string tmp(p);
            result.push_back(tmp);
            p = strtok(NULL, split);
        }
        return result;
    }
    int lengthOfLastWord(string s) {
        if(s.size() == 0)
            return 0;
        vector<string> words = stringSplit(s," ");
        if(words.size() == 0)
            return 0;
        return words[words.size() - 1].size();
    }
};

2016-08-10 18:11:30

时间: 2024-10-11 06:04:35

leetCode 58. Length of Last Word 字符串的相关文章

leetcode—58 Length of Last Word Total(字符串中最后一个单词的长度)

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 cha

Java [Leetcode 58]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-spa

leetcode 58 Length of Last Word ----- java

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 cha

LeetCode#58 Length of Last Word

Problem Definition: 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 consi

leetCode 58.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 consi

[LeetCode] 58. 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 cha

Leetcode 58 Length of Last Word 难度:0

https://leetcode.com/problems/length-of-last-word/ int lengthOfLastWord(char* s) { int ans = 0; int fans = 0; for(int i = 0;s[i];i++){ if (s[i] ==' '){fans = ans;ans = 0;while(s[i + 1] == ' '){i++;}} else ans++; } return ans?ans:fans; }

leetcode 题解: Length of Last Word

leetcode: 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

No.58 Length of Last Word

No.58 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