LeetCode 434. Number of Segments in a String

Description

Count the number of segments in a string, where a segment is defined to be a contiguous sequence of non-space characters.

Please note that the string does not contain any non-printable characters.

Example:

Input: "Hello, my name is John"
Output: 5

Analysis

习惯性地，希望使用trim()实现“掐头去尾”，然后统计空格段有几个，结果就是该数字+1。但C++标准库不支持trim()，需要自己实现：

string s;
s.erase(0,s.find_first_not_of(" "));
s.erase(s.find_last_not_of(" ") + 1);

Code

class Solution {
public:
    int countSegments(string s) {
        s.erase(0,s.find_first_not_of(" "));
        s.erase(s.find_last_not_of(" ") + 1);
        if (s.empty()) return 0;
        int result = 1;
        for (int i = 0; i < s.size() - 1; i++){
            result += (s[i] == ' ' && s[i + 1] != ' ');
        }
        return result;
    }
};

Appendix

• Link: https://leetcode.com/problems/number-of-segments-in-a-string/
• Run Time: 3ms