|
[x]
Posted via EE Mobile
|
|
| Search, ask, and monitor your questions on the go with EE Mobile. Visit Experts Exchange from your mobile device and never be out of touch again. |
|
|
|
|
Asked by manojvashisht in Java Server Pages (JSP), Algorithms
i have to Write an algorithm that determines whether a string contains a correctly nested set of matching brackets where valid brackets are of the form [{(< and >)}]. The algorithm should ignore all other characters including white space. The algorithm should return true in all cases where the brackets are correctly nested otherwise should return false.
_^e.g. "{[some text] more text!}" returns true
_^"example<text[something>
test]" returns false
i have never tried algo can any one please provide with any code?
20090824-EE-VQP-74 - Hierarchy / EE_QW_3_20080625