摊还分析与一道例题
w o r s t − c a s e    b o u n d ≥ a m o r t i z e d    b o u n d ≥ a v e r a g e − c a s e    b o u n d worst-case \,\,bound \ge amortized\,\,bound\ge average-case\,\,bound worst−casebound≥amortizedbound≥average−casebound
分析方法
- aggregate analysis 聚合分析
- accounting mothod 核算法
- potential method 势能函数法
题目：(来自浙江大学PTA，作者叶德社老师）
A queue can be implemented by using two stacks S A S_A SA and S B S_B SB as follows:
-
- To enqueue x, we push x onto S A S_A SA .
-
- To dequeue from the queue, we pop and return the top item from S B S_B SB . However, if S B S_B SB is empty, we first fill it (and empty S A S_A SA ) by popping the top item from
最低0.47元/天 解锁文章
8237
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
