[LeetCode] Length of Last Word
LeetCode of word length Last
2023-09-11 14:17:25 时间
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.
String
思路：遇到空格并且下一个字符不是空格或者‘\0’ ,len 清零，否则++；
class Solution { public: int lengthOfLastWord(const char *s) { const char *p = s; int len = 0; p = s; while(*p != '\0') { if(*p == ' ') { if(*(p+1) != ' ' && *(p+1) != '\0') len = 0; } else len ++; p++; } return len; } };
相关文章
- Java实现 LeetCode 832 翻转图像（位运算）
- SQL Server实现 LeetCode 177 第N高的薪水
- Java实现 LeetCode 173 二叉搜索树迭代器
- Java实现 LeetCode 10 正则表达式匹配
- Java实现LeetCode_0020_ValidParentheses
- LeetCode：111_Minimum Depth of Binary Tree | 二叉树的最小深度 | Easy
- LeetCode：104_Maximum Depth of Binary Tree | 二叉树的最大深度 | Easy
- 【LeetCode算法-58/66】Length of Last Word/Plus One
- [LeetCode] Intersection of Two Arrays
- [LeetCode] Summary Ranges
- LeetCode（39）：组合总和
- LeetCode-942. 增减字符串匹配【贪心，双指针，数学】
- 【LeetCode 42】接雨水
- 【LeetCode 简单 栈 python3】232. 用栈实现队列
- [LeetCode] 191. Number of 1 Bits ☆(位 1 的个数)
- LeetCode 235: Lowest Common Ancestor of a Binary Search Tree
- Median of Two Sorted Arrays--LeetCode
- LeetCode:Length of Last Word
- leetcode 345. Reverse Vowels of a String
- leetcode 235. Lowest Common Ancestor of a Binary Search Tree
- leetcode 326. Power of Three
- leetcode 747. Largest Number At Least Twice of Others
- leetcode 104. Maximum Depth of Binary Tree
- 【LeetCode】跳跃游戏II