12 2014 档案

[LeetCode]Reverse Linked List II
摘要：题目：Reverse a linked list from positionmton. Do it in-place and in one-pass.For example:Given1->2->3->4->5->NULL,m= 2 andn= 4,return1->4->3->2->5->NULL... 阅读全文
posted @ 2014-12-28 15:50 Jarvis_Wu 阅读(231) 评论(1) 推荐(0)
动态规划学习笔记（不定期更新）
摘要：最近刚开始接触动态规划（Dynamic Programming）算法，之前略有耳闻，一直觉得DP非常之高大上，看了某些题的DP解法也是云里雾里，哇擦？！这么几行代码就解决了？怎么全是数组操作？时间复杂度也很低的样子。其实不然，当我真正开始学习动态规划的时候才发现这货没那么玄乎。把我对DP浅显的理解总... 阅读全文
posted @ 2014-12-24 17:06 Jarvis_Wu 阅读(458) 评论(0) 推荐(0)
[LeetCode]Sum Root to Leaf Numbers
摘要：题目：Given a binary tree containing digits from0-9only, each root-to-leaf path could represent a number.An example is the root-to-leaf path1->2->3which ... 阅读全文
posted @ 2014-12-24 16:35 Jarvis_Wu 阅读(448) 评论(0) 推荐(1)
[LeetCode]Unique Binary Search Trees
摘要：题目：Givenn, how many structurally uniqueBST's(binary search trees) that store values 1...n?For example,Givenn= 3, there are a total of 5 unique BST's. ... 阅读全文
posted @ 2014-12-14 17:29 Jarvis_Wu 阅读(276) 评论(0) 推荐(0)
[LeetCode]Validate Binary Search Tree
摘要：题目：Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains onl... 阅读全文
posted @ 2014-12-05 15:02 Jarvis_Wu 阅读(158) 评论(0) 推荐(0)
[LeetCode]Search Insert Position
摘要：题目：Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in... 阅读全文
posted @ 2014-12-03 21:21 Jarvis_Wu 阅读(174) 评论(0) 推荐(0)