leetcode

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

remove_coloured_pc.c (836B)

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
// 2038. Remove Colored Pieces if Both Neighbors are the Same Color
#include <stdbool.h>
#include <stdio.h>
#include <string.h>

bool winnerOfGame(char *colours) {
  int n = strlen(colours);
  int grpa = 0, grpb = 0, cnt = 1;
  for (int i = 1; i < n; i++) {
    if (colours[i] == colours[i - 1])
      cnt++;
    else {
      if (cnt > 2) {
        if (colours[i - 1] == 'A')
          grpa += cnt - 2;
        else
          grpb += cnt - 2;
      }
      cnt = 1;
    }
  }
  if (cnt > 2) {
    if (colours[n - 1] == 'A')
      grpa += cnt - 2;
    else
      grpb += cnt - 2;
  }
  return grpa > grpb;
}

int main() {
  char c1[] = {"AAABABB"}, c2[] = {"AA"}, c3[] = {"ABBBBBBBAAA"};
  printf("%d\n", winnerOfGame(c1)); // expect: 1
  printf("%d\n", winnerOfGame(c2)); // expect: 0
  printf("%d\n", winnerOfGame(c3)); // expect: 0
}