摘要: 原题链接在这里:https://leetcode.com/problems/max-stack/description/ 题目: Design a max stack that supports push, pop, top, peekMax and popMax. push(x) -- Push 阅读全文
posted @ 2017-11-21 09:35 Dylan_Java_NYC 阅读(762) 评论(0) 推荐(0) 编辑