LeetCode Length of Last Word
阿新 • • 發佈:2017-05-06
archive n-1 art fine ive lan ets hello style
思路:還是比較easy的,就是要先把後面的‘ ’都先幹掉。
http://www.waitingfy.com/archives/1645
1. 題目
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
.
2.解決方式
class Solution { public: int lengthOfLastWord(const char *s) { int len = strlen(s); int result = 0; while(s[len-1]==‘ ‘) len--; for(int i = len - 1; i >= 0; --i){ if(s[i] != ‘ ‘){ ++result; }else{ break; } } return result; } };
思路:還是比較easy的,就是要先把後面的‘ ’都先幹掉。
http://www.waitingfy.com/archives/1645
LeetCode Length of Last Word