We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Data Structures
  3. Stacks
  4. Maximum Element
  5. Discussions

Maximum Element

  • yangand
     + 5 comments

    Hi, your idea is cool!

    +

    1. We can stack max elements only
    2. We can store count of elements that less than max and that have been pushed after max
    StackNode {
    int max
    int elementsAboveMax = 1
}

push {
    if (stack.peek.max < val)
    	stack.push( StackNode(val) )
    else
        stack.peek.elementsAboveMax++
}

pop {
    if (--stack.peek.elementsAboveMax == 0) stack.pop()
}

print {
    sout( stack.peek.max )
}