no this wont work coz wat will hapen if that min is popped out ? On Sun, Sep 4, 2011 at 11:11 PM, SANDEEP CHUGH <[email protected]>wrote:
> > we can take another variable min.. > > first time push operation is done , store the element into min.. > > next time push is performed , compare the number u r pushing with the > already stored no in "min" variable.. and store minimum of two no's in min > variable.. and thn perform the push operation.. > > so min always contain the minimum no... > > tell me will that approach work or not? > > On Sun, Sep 4, 2011 at 10:38 PM, Sangeeta <[email protected]> wrote: > >> How would you design a stack which,in addition to push and pop,also >> has a function min which returns the minimum element?push,pop and min >> should all operate in O(1) time >> >> -- >> 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. >> >> > -- > 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. > -- 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.
