Time: 0 ms (100%), Space: 17.8 MB (63.16%) - LeetHub

Author: hogan-tech

1802-number-of-students-unable-to-eat-lunch/1802-number-of-students-unable-to-eat-lunch.py

@@ -0,0 +1,32 @@
+# time complexity: O(n+m)
+# space complexity: O(1)
+from typing import List
+
+
+class Solution:
+    def countStudents(self, students: List[int], sandwiches: List[int]) -> int:
+        circleStudents = 0
+        squareStudents = 0
+        for student in students:
+            if student == 0:
+                circleStudents += 1
+            else:
+                squareStudents += 1
+        for sandwich in sandwiches:
+            if sandwich == 0 and circleStudents == 0:
+                return squareStudents
+            if sandwich == 1 and squareStudents == 0:
+                return circleStudents
+            if sandwich == 0:
+                circleStudents -= 1
+            else:
+                squareStudents -= 1
+        return 0
+
+
+students = [1, 1, 1, 0, 0, 1]
+sandwiches = [1, 0, 0, 0, 1, 1]
+print(Solution().countStudents(students, sandwiches))
+students = [1, 1, 1, 0, 0, 1]
+sandwiches = [1, 0, 0, 0, 1, 1]
+print(Solution().countStudents(students, sandwiches))