Dodomeki
Sign in

59. Min Stack History

Medium

Implement a stack by processing two parallel lists: operacoes and valores. The operations are adicionar, remover, topo and menor; each operation produces one position in the result. For adicionar and remover, return null; for topo, return the top element; for menor, return the current smallest element. If topo or menor is queried on an empty stack, return null for that operation.

Example 1
Input: operacoes = ["adicionar", "adicionar", "adicionar", "menor", "remover", "topo", "menor"], valores = [4, 2, 5, null, null, null, null]
Output: [null, null, null, 2, null, 2, 4]
Example 2
Input: operacoes = ["menor", "adicionar", "menor"], valores = [null, -3, null]
Output: [null, null, -3]
Constraints
  • 1 <= operacoes.length <= 10^4
  • Both lists have the same length.
  • The operations are valid and no removal is performed on an empty stack.
StackDesign
Caso 1
operacoes =
["adicionar","adicionar","adicionar","menor","remover","topo","menor"]
valores =
[4,2,5,null,null,null,null]
Expected =
[null,null,null,2,null,2,2]
Caso 2
operacoes =
["menor","adicionar","menor","adicionar","adicionar","menor","remover","menor"]
valores =
[null,-3,null,-3,8,null,null,null]
Expected =
[null,null,-3,null,null,-3,null,-3]

Run checks these 2 cases. Submit runs all 6, including hidden ones.