lothar.buchholz
/
is-string-well-formed
forked from code-clash/is-string-well-formed
0
0
Fork 1
Code Issues Pull Requests Releases Wiki Activity
You cannot select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
7 Commits
2 Branches
0 Tags
82 KiB
Java 73.4%
Gradle 19.6%
CSV 7%
 
 
 
recursive-iterator
master
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'master'
${ noResults }
Go to file
Lothar Buchholz 16ee5b632a more tests; write System.err to console 4 years ago
.idea default IntelliJ settings; run config 4 years ago
gradle/wrapper Initial commit 4 years ago
src more tests; write System.err to console 4 years ago
.gitignore exclude compiler settings 4 years ago
README.md Added Readme and testdata 4 years ago
build.gradle Initial commit 4 years ago
gradlew Initial commit 4 years ago
gradlew.bat Initial commit 4 years ago
settings.gradle Added Readme and testdata 4 years ago

README.md

Test a String for '(),[],{}' well-formedness

Goal

A string over the characters ()[]{} is said to be well-formed, if the different types of brackets match in the correct order.

Write a program that outputs true or false depending on the well-formedness of the input.

Example

Input Output
([{}])() true
([)] false

Constraints

Input strings consist only of characters ()[]{}