[LeetCode] Pascal's Triangle II 解题报告

摘要: Given an index k, return the kth row of the Pascal's triangle.For example, given k = 3,Return [1,3,3,1].[ [1], [1,1], [1,2,1], [1,3,3,1], [1... 阅读全文
posted @ 2012-12-29 13:15 小刀初试 阅读(151) 评论(0) 推荐(0)

[LeetCode] Partition List 解题报告

摘要: Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.You should preserve the o... 阅读全文
posted @ 2012-12-29 12:51 小刀初试 阅读(139) 评论(0) 推荐(0)

[LeetCode] Palindrome Number 解题报告

摘要: Determine whether an integer is a palindrome. Do this without extra space.Some hints:Could negative integers be palindromes? (ie, -1)If you are thinki... 阅读全文
posted @ 2012-12-29 12:26 小刀初试 阅读(155) 评论(0) 推荐(0)