Balancing Parentheses Algorithm - Java

main.java

import java.util.Stack;

public class Main {
  public static boolean isBalanced(String str) {
    Stack<Character> stack = new Stack<>();
    for (char c : str.toCharArray()) {
      switch (c) {
        case '(':
        case '{':
          stack.push(c);
          break;
        case ')':
        case '}':
          if (stack.isEmpty() || c != getMatchingBrace(stack.peek())) {
            return false;
          }
          stack.pop();
          break;
      }
    }
    return stack.isEmpty();
  }

  private static char getMatchingBrace(char c) {
    switch (c) {
      case '(':
        return ')';
      case '{':
        return '}';
      default:
        return '\0';
    }
  }

  public static void main(String[] args) {
    String str1 = "{{()}}";
    String str2 = "{{(}}";
    String str3 = "{{()}";
    String str4 = "";
    System.out.println(isBalanced(str1));
    System.out.println(isBalanced(str2));
    System.out.println(isBalanced(str3));
    System.out.println(isBalanced(str4));
  }
}