carloscn / carloscn/structstudy
leetcode434:字符串中的单词数(number-of-segments-in-a-string)
Open
Level-easy
一般问题
字符串
查找
- Dominant language
- C
- Stars
- 4
- Forks
- 1
- PR merge metrics
- No merged PRs in 30d
Description
### 问题描述
统计字符串中的单词个数,这里的单词指的是连续的不是空格的字符。
请注意,你可以假定字符串里不包括任何不可打印的字符。
示例:
输入: "Hello, my name is John"
输出: 5
解释: 这里的单词是指连续的不是空格的字符,所以 "Hello," 算作 1 个单词。
来源:力扣(LeetCode)
链接:https://leetcode.cn/problems/number-of-segments-in-a-string
Contributor guide
No contributing guide indexed for this repository
Assessment
This issue has not been assessed yet.