Skip to content

Commit f15db2e

Browse files
solves #3168: Minimum Number of Chairs in a Waiting Room in java
1 parent faaa538 commit f15db2e

File tree

2 files changed

+19
-1
lines changed

2 files changed

+19
-1
lines changed

Diff for: README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -914,7 +914,7 @@
914914
| 3151 | [Special Array I](https://leetcode.com/problems/special-array-i) | [![Java](assets/java.png)](src/SpecialArrayI.java) | |
915915
| 3158 | [Find the XOR of Numbers Which Appear Twice](https://leetcode.com/problems/find-the-xor-of-numbers-which-appear-twice) | [![Java](assets/java.png)](src/FindTheXOROfNumbersWhichAppearTwice.java) | |
916916
| 3162 | [Find the Number of Good Pairs I](https://leetcode.com/problems/find-the-number-of-good-pairs-i) | [![Java](assets/java.png)](src/FindTheNumberOfGoodPairsI.java) | |
917-
| 3168 | [Minimum Number of Chairs in a Waiting Room](https://leetcode.com/problems/minimum-number-of-chairs-in-a-waiting-room) | | |
917+
| 3168 | [Minimum Number of Chairs in a Waiting Room](https://leetcode.com/problems/minimum-number-of-chairs-in-a-waiting-room) | [![Java](assets/java.png)](src/MinimumNumberOfChairsInAWaitingRoom.java) | |
918918
| 3173 | [Bitwise OR of Adjacent Elements](https://leetcode.com/problems/bitwise-or-of-adjacent-elements) | | |
919919
| 3174 | [Clear Digits](https://leetcode.com/problems/clear-digits) | | |
920920
| 3178 | [Find the Child Who Has the Ball After K Seconds](https://leetcode.com/problems/find-the-child-who-has-the-ball-after-k-seconds) | | |

Diff for: src/MinimumNumberOfChairsInAWaitingRoom.java

+18
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
// https://leetcode.com/problems/minimum-number-of-chairs-in-a-waiting-room
2+
// T: O(N)
3+
// S: O(1)
4+
5+
public class MinimumNumberOfChairsInAWaitingRoom {
6+
public int minimumChairs(String s) {
7+
int minChairs = 0;
8+
for (int i = 0, sum = 0 ; i < s.length() ; i++) {
9+
if (s.charAt(i) == 'E') {
10+
sum++;
11+
} else {
12+
sum--;
13+
}
14+
minChairs = Math.max(minChairs, sum);
15+
}
16+
return minChairs;
17+
}
18+
}

0 commit comments

Comments
 (0)