@rahul.. there is one exception to the above rule and that is the case with unary minus operator.. for ex : a + (-c) + d will need one parentheses, but a + ( -c + d ) will only need 1 instead of 2.. But for the sake of unary minus u can assume that it will be enclosed within a parenthesis..
On Dec 11, 4:07 am, Lucifer <[email protected]> wrote: > @rahul... > > If you are plan to just find out the no. of duplicate parenthesis, > then that would be ( No. of open Parenthesis - No. of Operators + 1) > > On Dec 10, 10:22 pm, rahul venkat <[email protected]> wrote: > > > > > > > > > hi everyone, > > > can u suggest an algorithm for finding the duplicate paranthesis in a given > > expression ? > > > for example , the expression (( a + b ) * (( c + d ))) has a set of > > duplicate paranthesis. > > > thanks in advance . -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
