fix BalancedBrackets.java

This commit is contained in:
khalil2535
2018-04-14 07:16:38 +03:00
parent 82ef795675
commit e5e6fc154d

View File

@ -1,59 +1,89 @@
/* package data_structures.Stacks;
The nested brackets problem is a problem that determines if a sequence of
brackets are properly nested. A sequence of brackets s is considered properly nested
if any of the following conditions are true:
- s is empty
- s has the form (U) or [U] or {U} where U is a properly nested string
- s has the form VW where V and W are properly nested strings
For example, the string "()()[()]" is properly nested but "[(()]" is not.
The function called is_balanced takes as input a string S which is a sequence of brackets and
returns true if S is nested and false otherwise.
author: akshay sharma
date: 2017-10-17
*/
import java.util.Scanner; import java.util.Scanner;
import java.util.Stack; import java.util.Stack;
import java.util.ArrayList;
/**
*
* The nested brackets problem is a problem that determines if a sequence of
* brackets are properly nested. A sequence of brackets s is considered properly
* nested if any of the following conditions are true: - s is empty - s has the
* form (U) or [U] or {U} where U is a properly nested string - s has the form
* VW where V and W are properly nested strings For example, the string
* "()()[()]" is properly nested but "[(()]" is not. The function called
* is_balanced takes as input a string S which is a sequence of brackets and
* returns true if S is nested and false otherwise.
*
* @author akshay sharma
* @date: 2017-10-17
* @author <a href="https://github.com/khalil2535">khalil2535<a>
*
*/
class BalancedBrackets { class BalancedBrackets {
static boolean is_balanced(char[] S) { /**
Stack<Character> stack = new Stack<>(); *
String pair = ""; * @param s
for (int i = 0; i < S.length; ++i) { * @return
if (S[i] == '(' || S[i] == '{' || S[i] == '[') { */
stack.push(S[i]); static boolean is_balanced(String s) {
} else if (stack.size() > 0) { Stack<Character> bracketsStack = new Stack<>();
if (!pair.equals("[]") && !pair.equals("()") && !pair.equals("{}")) { char[] text = s.toCharArray();
return false; for (char x : text) {
} switch (x) {
} else { case '{':
return false; case '<':
case '(':
case '[':
bracketsStack.push(x);
break;
case '}':
if (bracketsStack.peek() == '{') {
bracketsStack.pop();
break;
} else {
return false;
}
case '>':
if (bracketsStack.peek() == '<') {
bracketsStack.pop();
break;
} else {
return false;
}
case ')':
if (bracketsStack.peek() == '(') {
bracketsStack.pop();
break;
} else {
return false;
}
case ']':
if (bracketsStack.peek() == '[') {
bracketsStack.pop();
break;
} else {
return false;
}
} }
} }
return bracketsStack.empty();
return stack.isEmpty();
}
static void print(Object a) {
System.out.println(a);
} }
/**
*
* @param args
* @TODO remove main method and Test using JUnit or other methodology
*/
public static void main(String args[]) { public static void main(String args[]) {
try { try (Scanner in = new Scanner(System.in)) {
Scanner in = new Scanner(System.in); System.out.println("Enter sequence of brackets: ");
print("Enter sequence of brackets: "); String s = in.nextLine();
String S = in.nextLine(); if (is_balanced(s)) {
if (is_balanced(S.toCharArray())) { System.out.println(s + " is balanced");
print(S + " is balanced");
} else { } else {
print(S + " ain't balanced"); System.out.println(s + " ain't balanced");
} }
in.close();
} catch (Exception e) {
e.toString();
} }
} }
} }