LeetCode_2024/October/LC1963.java at main · DevendraCollage/LeetCode_2024 · 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
/*
 * LC1963
 */

import java.util.*;

public class LC1963 {
    public static int minSwaps(String s) {
        // Unoptimized way using Stack
        // Stack<Character> stack = new Stack<>();

        int open = 0;
        int close = 0;
        for (int i = 0; i < s.length(); i++) {
            char ch = s.charAt(i);
            if (ch == '[') {
                // stack.push(ch);
                open++;
            } else {
                // if (stack.isEmpty() || stack.peek() == ']') {
                // stack.push(ch);
                // } else {
                // stack.pop();
                // }
                if (open <= 0) {
                    close++;
                } else {
                    open--;
                }
            }
        }
        // int totalBrackets = stack.size();
        // int closedBrackets = totalBrackets / 2;
        return (close + 1) / 2;
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        System.out.print("Enter The String Here : ");
        String str = sc.nextLine();
        System.out.println();

        int ans = minSwaps(str);

        System.out.println(ans);

        sc.close();
    }
}