leetcode

Leetcode Solutions (0x6A73)
git clone https://git.pngu.org/leetcode
Log | Files | Refs | Submodules | README

check_binary_str_one_seg.c (538B)

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
// 1784. Check if Binary String Has at Most One Segment of Ones
#include "leetcode.h"

/*
 * given a binary string 's' without leading zeros, return 'true' if 's'
 * contains at most one contiguous segment of ones. otherwise, return false.
 */

bool checkOnesSegment(char *s) { return !strstr(s, "01"); }

int main() {
  char *s1 = "1001", *s2 = "110";
  bool r1 = checkOnesSegment(s1);
  bool r2 = checkOnesSegment(s2);
  printf("%d\n", r1); // expect: 0
  assert(r1 == false);
  printf("%d\n", r2); // expect: 1
  assert(r2 == true);
}