# LeetCode 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'`.

## Solution:

```
class Solution {
public:
    bool checkOnesSegment(string s) {
        return s.find("01") == string::npos;
    }
};
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://zhenchaogan.gitbook.io/leetcode-solution/leetcode-1784-check-if-binary-string-has-at-most-one-segment-of-ones.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.