1784. Check if Binary String Has at Most One Segment of Ones

Given a binary string s ​​​​​without leading zeros, return true​​​ if s contains at most one contiguous segment of ones. Otherwise, return false.

 

Example 1:

Input: s = "1001"
Output: false
Explanation: The ones do not form a contiguous segment.
Example 2:

Input: s = "110"
Output: true
 

Constraints:

1 <= s.length <= 100
s[i]​​​​ is either '0' or '1'.
s[0] is '1'.

这题的通过率不高，但是只要检测字符串里是否有”01”序列即可。

class CheckIfBinaryStringHasAtMostOneSegmentOfOnes : public Solution {
public:
    void Exec() {

    }
    bool checkOnesSegment(string s) {
        for (int i = 1; i < s.size(); i++) {
            if (s[i - 1] == '0' && s[i] == '1') {
                return false;
            }
        }   
        return true;
    }
};