Solving brackets sequence problem

Brackets.java

package datastructures.main;

import java.util.Stack;

public class Brackets {
    public static void main(String[] args) {
        boolean isValid = false;
        String inputString = "[()]()()()";
        Stack<Character> myStack = new Stack<>();
        boolean valid = true;
        for (int i = 0; i < inputString.length(); i++) {
            if (!valid) break;
            char currentChar = inputString.charAt(i);
            switch (currentChar) {
                case '{':
                    myStack.push('{');
                    break;
                case '[':
                    myStack.push('[');
                    break;
                case '(':
                    myStack.push('(');
                    break;
                case ')':
                    if (!myStack.empty() && myStack.peek().equals('(')) myStack.pop();
                    else valid = false;
                    break;
                case ']':
                    if (!myStack.empty() && myStack.peek().equals('[')) myStack.pop();
                    else valid = false;
                    break;
                case '}':
                    if (!myStack.empty() && myStack.peek().equals('{')) myStack.pop();
                    else valid = false;
                    break;
            }
        }
        if (myStack.empty() && valid) isValid = true;
        System.out.println("isValid --> " + isValid);

    }
}