LeetCode Solutions/Problems/1784. Check if Binary String Has at Most One Segment of Ones.java
<filename>LeetCode Solutions/Problems/1784. Check if Binary String Has at Most One Segment of Ones.javaclass Solution {
    public boolean checkOnesSegment(String s) {
        return !s.contains("01");
    }
}