leetcode

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

num_student_unable_eat.c (1241B)

 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
37
38
39
40
41
// 1700. Number of Students Unable to Eat Lunch
#include "leetcode.h"

/*
 * the school cafeteria offers circular and square sandwiches at lunch break,
 * referred to by numbers 0 and 1, respectively. all students stand in a queue.
 * each student either prefers square or circular sandwiches. the number of
 * sandwiches in the cafeteria is equal to the number of students.
 */

int countStudents(int *students, int studentsSize, int *sandwiches,
                  int sandwichesSize) {
  int n = studentsSize, one_cnt = 0, zero_cnt = 0;
  for (int i = 0; i < n; i++)
    if (students[i])
      one_cnt++;
  zero_cnt = n - one_cnt;
  for (int i = 0; i < n; i++) {
    if (sandwiches[i]) {
      if (one_cnt)
        one_cnt--;
      else
        return n - i;
    } else {
      if (zero_cnt)
        zero_cnt--;
      else
        return n - i;
    }
  }
  return 0;
}

int main() {
  int st1[] = {1, 1, 0, 0}, sa1[] = {0, 1, 0, 1}, st2[] = {1, 1, 1, 0, 0, 1},
      sa2[] = {1, 0, 0, 0, 1, 1};
  printf("%d\n", countStudents(st1, ARRAY_SIZE(st1), sa1,
                               ARRAY_SIZE(sa1))); // expect: 0
  printf("%d\n", countStudents(st2, ARRAY_SIZE(st2), sa2,
                               ARRAY_SIZE(sa2))); // expect: 3
}