数据结构栈和队列课稿.ppt

算法描述 0 1 0 0 0 0 0 0 0 0 1 0 1 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 1 0 0 0 1 0 1 0 1 0 1 1 0 1 0 1 1 0 1 0 1 0 0 0 0 1 0 1 1 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 1 1 0 1 1 R= 2 5 6 7 8 9 0 1 2 3 4 5 6 7 8 cq f r 0 1 0 0 1 1 1 0 1 0 1 2 3 4 5 6 7 8 newr 1 0 1 1 0 0 0 0 0 0 1 2 3 4 5 6 7 8 result R={ (2,8), (9,4), (2,9), (2,1), (2,5), (6,2), (5,9), (5,6), (5,4), (7,5), (7,6), (3,7), (6,3) } 算法描述 0 1 0 0 0 0