InterviewBit-Solutions/Programming/Stacks/RedundantBraces.java at master · architsingla13/InterviewBit-Solutions · GitHub

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
66
67
68
69
70
71
72
73
74
75
76
77
package Stacks;

import java.util.Stack;

/**
 * Author - archit.s
 * Date - 24/10/18
 * Time - 11:28 PM
 */
public class RedundantBraces {

    public int braces(String A) {

        Stack<Character> s = new Stack<>();

        for(int i=0;i<A.length();i++){

            if(A.charAt(i) == ' '){
                continue;
            }

            switch(A.charAt(i)){
                case '(':
                case '{':
                case '[':
                    s.push(A.charAt(i));
                    break;
                case ')':
                case '}':
                case ']':
                    char v = s.peek();
                    if(v == '(' || v == '{' || v == '['){
                        return 1;
                    }
                    s.pop();
                    int topElement = v;
                    char sign = s.peek();
                    s.pop();
                    int bottomElement;
                    switch(sign){
                        case '+':
                            bottomElement = s.peek();
                            s.pop();
                            s.pop();
                            s.push((char) (bottomElement + topElement));
                            break;
                        case '-':
                            bottomElement = s.peek();
                            s.pop();
                            s.pop();
                            s.push((char) (bottomElement - topElement));
                            break;
                        case '*':
                            bottomElement = s.peek();
                            s.pop();
                            s.pop();
                            s.push((char) (bottomElement*topElement));
                            break;
                        case '/':
                            bottomElement = s.peek();
                            s.pop();
                            s.pop();
                            s.push((char) (bottomElement/topElement));
                            break;
                        default:
                            return 1;
                    }
                    break;
                default:
                    s.push(A.charAt(i));
            }
        }

        return 0;
    }

}