-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathBalancedOrNot.java
63 lines (51 loc) · 1.71 KB
/
BalancedOrNot.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
import java.util.Scanner;
public class BalancedOrNot{
public static void main(String []args){
Scanner in = new Scanner(System.in);
int noOfExpr = in.nextInt();
String[] expr = new String[noOfExpr];
for(int i =0; i<noOfExpr; i++) {
expr[i] = in.next();
}
int maxReplacements = in.nextInt();
int[] arrMaxReplacements = new int[maxReplacements];
for(int i =0; i<maxReplacements; i++) {
arrMaxReplacements[i] = in.nextInt();
}
int[] result = balancedOrNot(expr, arrMaxReplacements);
for(int i =0; i<result.length; i++) {
System.out.println(result[i]);
}
}
static int[] balancedOrNot(String[] expressions, int[] maxReplacements) {
int[] result = new int[expressions.length];
for(int i =0; i< expressions.length; i++) {
String expr = expressions[i];
int maxRep = maxReplacements[i];
int totalReplacement = 0;
for(int j =0; j<expr.length(); j++) {
char ch = expr.charAt(j);
if(ch == '>') {
totalReplacement++;
} else {
if(ch =='<') {
//check the next charracter is >
if(j != expr.length()-1 && expr.charAt(j+1) == '>') {
j ++;
continue;
}
else {
totalReplacement++;
}
}
}
}
if(totalReplacement <= maxRep) {
result[i] = 1;
}else {
result[i] =0;
}
}
return result;
}
}