-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathChairsNeeded.java
65 lines (47 loc) · 1.08 KB
/
ChairsNeeded.java
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
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
package collectionz;
//Java program for the above approach
import java.io.*;
import java.util.*;
class ChairsNeeded
{
//Function to find the minimum number
//of chairs required to ensure that
//every worker is seated at any time
static int findMinimumChairs(String s)
{
// Stores the number of
// chairs required
int count = 0;
// Pointer to iterate
int i = 0;
// Stores minimum number of
// chairs required
int mini = Integer.MIN_VALUE;
// Iterate over every character
while (i < s.length()) {
// If character is 'E'
if (s.charAt(i) == 'E')
// Increase the count
count++;
// Otherwise
else
count--;
// Update maximum value of count
// obtained at any given time
mini = Math.max(count, mini);
i++;
}
// Return mini
return mini;
}
//Driver code
public static void main(String[] args)
{
// Input
// Given String
String s = "EELEE";
// Function call to find the
// minimum number of chairs
System.out.print(findMinimumChairs(s));
}
}