| | | 1 | | // -------------------------------------------------------------------------------- |
| | | 2 | | // Copyright (C) 2025 Eugene Eremeev (also known as Yevhenii Yeriemeieiv). |
| | | 3 | | // All Rights Reserved. |
| | | 4 | | // -------------------------------------------------------------------------------- |
| | | 5 | | // This software is the confidential and proprietary information of Eugene Eremeev |
| | | 6 | | // (also known as Yevhenii Yeriemeieiv) ("Confidential Information"). You shall not |
| | | 7 | | // disclose such Confidential Information and shall use it only in accordance with |
| | | 8 | | // the terms of the license agreement you entered into with Eugene Eremeev (also |
| | | 9 | | // known as Yevhenii Yeriemeieiv). |
| | | 10 | | // -------------------------------------------------------------------------------- |
| | | 11 | | |
| | | 12 | | namespace LeetCode.Algorithms.NumberOfStudentsUnableToEatLunch; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class NumberOfStudentsUnableToEatLunchIterative : INumberOfStudentsUnableToEatLunch |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n) |
| | | 19 | | /// Space complexity - O(1) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="students"></param> |
| | | 22 | | /// <param name="sandwiches"></param> |
| | | 23 | | /// <returns></returns> |
| | | 24 | | public int CountStudents(int[] students, int[] sandwiches) |
| | 2 | 25 | | { |
| | 2 | 26 | | var countZero = 0; |
| | 2 | 27 | | var countOne = 0; |
| | | 28 | | |
| | 26 | 29 | | foreach (var student in students) |
| | 10 | 30 | | { |
| | 10 | 31 | | if (student == 0) |
| | 4 | 32 | | { |
| | 4 | 33 | | countZero++; |
| | 4 | 34 | | } |
| | | 35 | | |
| | | 36 | | else |
| | 6 | 37 | | { |
| | 6 | 38 | | countOne++; |
| | 6 | 39 | | } |
| | 10 | 40 | | } |
| | | 41 | | |
| | 21 | 42 | | foreach (var sandwich in sandwiches) |
| | 8 | 43 | | { |
| | 8 | 44 | | if (sandwich == 0 && countZero > 0) |
| | 4 | 45 | | { |
| | 4 | 46 | | countZero--; |
| | 4 | 47 | | } |
| | 4 | 48 | | else if (sandwich == 1 && countOne > 0) |
| | 3 | 49 | | { |
| | 3 | 50 | | countOne--; |
| | 3 | 51 | | } |
| | | 52 | | else |
| | 1 | 53 | | { |
| | 1 | 54 | | break; |
| | | 55 | | } |
| | 7 | 56 | | } |
| | | 57 | | |
| | 2 | 58 | | return countZero + countOne; |
| | 2 | 59 | | } |
| | | 60 | | } |