The next variable I’m creating is just an empty array, which we can call stack, as this will be our stack. My particular solution would not work if the bracket string were to be written as “ ” are both perfectly fine), but the opening and closing brackets must be written together.
Note : I am pairing the opening and closing brackets together in this string.
I’m saving a string listing all my potential opening and closing brackets to a variable named brackets. This is what is meant by saying that brackets are “balanced” - not only do they exist in the correct number of matching pairs, but that those pairs are arranged correctly so that the closing brackets can balance the opening brackets.įirst, I’m making a few workhorse variables for myself. Not only that, if we wanted this function to be useful for any sort of IDE syntax highlighting or other practical application, it would need to identify not only that the opening and closing brackets exist in the correct number and type, but also that they are arranged in the correct order - that every opening bracket has a matching closing bracket in the correct place in the string to actually close it. We need to know not only that there is a closing bracket for each opening bracket, but also that the specific type of opening and closing brackets match each other. That approach may work on the occasional simple string, but it breaks down pretty quickly. The first time I looked at this problem, my first instinct was to try to just sort the string into substrings based on whether each character was an open or closing bracket and compare the lengths of the substrings.
0 kommentar(er)
