Skip to content

Latest commit

 

History

History
55 lines (42 loc) · 2.16 KB

README.md

File metadata and controls

55 lines (42 loc) · 2.16 KB

< Previous 　　　　　　　　　　　　　　　　 Next >

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

Related Topics

[String]

Similar Questions

  1. Longer Contiguous Segments of Ones than Zeros (Easy)

Hints

Hint 1 It's guaranteed to have at least one segment
Hint 2 The string size is small so you can count all segments of ones with no that have no adjacent ones.