2021年5月23日
07-图5 Saving James Bond - Hard Version (30 分) 被虐到哭的一道题
摘要： 题面： This time let us consider the situation in the movie "Live and Let Die" in which James Bond, the world's most famous spy, was captured by a group 阅读全文
posted @ 2021-05-23 19:51 柚子z 阅读(141) 评论(0) 推荐(0)
2021年4月25日
树3 Tree Traversals Again 代码
摘要： 03-树3 Tree Traversals Again (25 分) An inorder binary tree traversal can be implemented in a non-recursive way with a stack. For example, suppose that 阅读全文
posted @ 2021-04-25 23:22 柚子z 阅读(93) 评论(0) 推荐(0)
2021年4月14日
Pop Sequence 题解 代码 心得
摘要： Pop Sequence 题面 Given a stack which can keep M numbers at most. Push N numbers in the order of 1, 2, 3, ..., N and pop randomly. You are supposed to t 阅读全文
posted @ 2021-04-14 15:08 柚子z 阅读(89) 评论(0) 推荐(0)