2014年11月2日
[Leetcode] Pascal's Triangle II
摘要： Given an indexk, return thekthrow of the Pascal's triangle.For example, givenk= 3,Return[1,3,3,1].Note:Could you optimize your algorithm to use onlyO(... 阅读全文
posted @ 2014-11-02 10:42 Phoebe815 阅读(151) 评论(0) 推荐(0)
[Leetcode] Pascal's Triangle
摘要： GivennumRows, generate the firstnumRowsof Pascal's triangle.For example, givennumRows= 5,Return[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1]... 阅读全文
posted @ 2014-11-02 04:59 Phoebe815 阅读(112) 评论(0) 推荐(0)
[Leetcode] Merge Sorted Array
摘要： Given two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that is greater or equal... 阅读全文
posted @ 2014-11-02 04:19 Phoebe815 阅读(90) 评论(0) 推荐(0)
[Leetcode] Binary Tree Level Order Traversal II
摘要： Given a binary tree, return thebottom-up level ordertraversal of its nodes' values. (ie, from left to right, level by level from leaf to root).For exa... 阅读全文
posted @ 2014-11-02 03:51 Phoebe815 阅读(156) 评论(0) 推荐(0)
[Leetcode] Binary Tree Level Order Traversal
摘要： Given a binary tree, return thelevel ordertraversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree{3,9,2... 阅读全文
posted @ 2014-11-02 02:59 Phoebe815 阅读(127) 评论(0) 推荐(0)