leetcode

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

1bit_2bit_chars.c (686B)

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
// 717. 1-bit and 2-bit Characters
#include "leetcode.h"

/*
 * we have two special characters: the first character is represented by one bit
 * 0, and the second character can be represented by two bits (10 or 11). given
 * a binary array 'bits' that ends with 0, return true if the last character
 * must be a one-bit character.
 */

bool isOneBitCharacter(int *bits, int bitsSize) {
  int i = bitsSize - 2;
  while (i >= 0 && bits[i] > 0)
    i--;
  return !((bitsSize - i) % 2);
}

int main() {
  int b1[] = {1, 0, 0}, b2[] = {1, 1, 1, 0};
  printf("%d\n", isOneBitCharacter(b1, ARRAY_SIZE(b1))); // expect: 1
  printf("%d\n", isOneBitCharacter(b2, ARRAY_SIZE(b2))); // expect: 0
}