- Forum
- General C++ Programming
- The standard and definitive algorithm of
The standard and definitive algorithm of matching brace pair
How is the standard and definitive algorithm of matching brace pairs, as a point at a brace or within brace pair must find correctly the either or both open/close brace?
Normally you'd just push each '{' symbol onto a stack, and pop off the symbol once you find a '}'.
If, at the end of the file, you have anything left in the stack, or if you try to pop an empty stack, then something is mismatched.
If, at the end of the file, you have anything left in the stack, or if you try to pop an empty stack, then something is mismatched.
Last edited on
Bitch please, I don't got all the answers. Stick to your own thread, it's texture UV mapping, do the math.
Geez, have some manners, dude.
Don't post in other people's threads to tell someone something off-topic. Don't ask someone specifically to check out your question in a public forum. Just because someone posted in your thread doesn't entitle you to their follow-up response.
Don't post in other people's threads to tell someone something off-topic. Don't ask someone specifically to check out your question in a public forum. Just because someone posted in your thread doesn't entitle you to their follow-up response.
fewdiefie and cblack have quite a lot in common, it seems judging by his previous posts.
Topic archived. No new replies allowed.