2016年1月6日

[lintcode medium]Pow(x, n)
摘要： Implement pow(x, n).NoteYou don't need to care about the precision of your answer, it's acceptable if the expected answer and your answer 's differenc... 阅读全文
posted @ 2016-01-06 06:51 一心一念 阅读(165) 评论(0) 推荐(0) 编辑
[lintcode medium] Binary Tree Level Order Traversal II
摘要： Binary Tree Level Order Traversal IIGiven a binary tree, return thebottom-up level ordertraversal of its nodes' values. (ie, from left to right, level... 阅读全文
posted @ 2016-01-06 03:31 一心一念 阅读(140) 评论(0) 推荐(0) 编辑
[lintcode medium]Implement Queue by Two Stacks
摘要： Implement Queue by Two StacksAs the title described, you should only use two stacks to implement a queue's actions.The queue should support push(eleme... 阅读全文
posted @ 2016-01-06 02:16 一心一念 阅读(143) 评论(0) 推荐(0) 编辑

导航