Solution (leetcode-in-java 1.21 API)

java.lang.Object
- g1701_1800.s1784_check_if_binary_string_has_at_most_one_segment_of_ones.Solution

```
public class Solution
extends Object
```
1784 - Check if Binary String Has at Most One Segment of Ones.
Easy

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'.

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  boolean checkOnesSegment(String s)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

checkOnesSegment

public boolean checkOnesSegment(String s)