原问题转化为求字符串中单词的第一个下标的个数
class Solution {
public:
int countSegments(string s) {
int segmentCount = 0;
for (int i = 0; i < s.size(); i++) {
if ((i == 0 || s[i - 1] == ' ') && s[i] != ' ') {
segmentCount++;
}
}
return segmentCount;
}
};
作者:LeetCode-Solution
链接:https://leetcode-cn.com/problems/number-of-segments-in-a-string/solution/zi-fu-chuan-zhong-de-dan-ci-shu-by-leetc-igfb/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。