【Leetcode】Length of Last Word

來源:互聯網
上載者:User

標籤:style   class   blog   code   color   2014   

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.

思路:從後往前搜尋直到第一個空格字元,注意“a ”的結果是1而不是0,因此需要先排除最後的空格字元。

class Solution {public:    int lengthOfLastWord(const char *s) {        if(s == NULL)   return 0;                int length = strlen(s);                int result = 0;        for(int i = length - 1; i >= 0 && s[i] == ' '; i--)            length--;                    for(int i = length - 1; i >= 0; i--)        {            if(s[i] != ' ')                result++;            else                break;        }                return result;    }};

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.