Problem 1 Write a complete Java program that takes an integer and displays the English name of that value. You should support both positive and negative numbers, in the range supported by a 32-bit integer (approximately -2 billion to 2 billion). 10 -> ten 121 -> one hundred twenty one 1032 -> one thousand thirty two 11043 -> eleven thousand forty three 1200000 -> one million two hundred thousand
Problem 1
Write a complete Java program that takes an integer and displays the English name of that value. You should support both positive and negative numbers, in the range supported by a 32-bit integer (approximately -2 billion to 2 billion).
10 -> ten
121 -> one hundred twenty one
1032 -> one thousand thirty two
11043 -> eleven thousand forty three
1200000 -> one million two hundred thousand
Problem 2
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 2 steps
