2015年4月13日
[LeetCode] Valid Palindrome
摘要： Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example,"A man, a plan, a canal: Pana... 阅读全文
posted @ 2015-04-13 16:47 穆穆兔兔 阅读(178) 评论(0) 推荐(0)
[LeetCode] Binary Tree Maximum Path Sum
摘要： Given a binary tree, find the maximum path sum.The path may start and end at any node in the tree.For example:Given the below binary tree, 1 ... 阅读全文
posted @ 2015-04-13 16:12 穆穆兔兔 阅读(171) 评论(0) 推荐(0)
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 @ 2015-04-13 11:28 穆穆兔兔 阅读(182) 评论(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 @ 2015-04-13 11:19 穆穆兔兔 阅读(113) 评论(0) 推荐(0)