Write a java code for this problem General Statement: Read a string and determine whether each left parenthesis ‘(‘ has a matching right parenthesis ‘)’. Input: The first line of the data set for this problem is an integer that represents the number of strings that follow. Each string is on a separate line. Output: Output either MATCH or NO MATCH. All letters are upper case. The output is to be formatted exactly like that for the sample output given below. Assumptions: All letters are upper case. ( and ) are the only enclosure symbols in the string. Discussion: The left parenthesis must come before the right parenthesis in order to count as a matched set of parentheses. Sample Input: 3 (3 + (7 * 2) – 6) HELLO AND (WELCOME (TO THE) TCEA (CONTEST) TODAY) IS ((SATURDAY()) Sample Output: MATCH NO MATCH NO MATCH
Write a java code for this problem
General Statement: Read a string and determine whether each left parenthesis ‘(‘ has a matching right parenthesis ‘)’.
Input: The first line of the data set for this problem is an integer that represents the number of strings that follow. Each string is on a separate line.
Output: Output either MATCH or NO MATCH.
All letters are upper case.
The output is to be formatted exactly like that for the sample output given below.
Assumptions: All letters are upper case.
( and ) are the only enclosure symbols in the string.
Discussion: The left parenthesis must come before the right parenthesis in order to count as a matched set of parentheses.
Sample Input:
3
(3 + (7 * 2) – 6)
HELLO AND (WELCOME (TO THE) TCEA (CONTEST)
TODAY) IS ((SATURDAY())
Sample Output:
MATCH
NO MATCH
NO MATCH
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
