上一页 1 2 3 4 5 6 7 8 ··· 16 下一页
2015年1月24日
Copy List with Random Pointer （Hash表）
摘要： A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.Return a deep copy ... 阅读全文
posted @ 2015-01-24 16:44 雄哼哼 阅读(171) 评论(0) 推荐(0) 编辑
Linked List Cycle II
摘要： Given a linked list, return the node where the cycle begins. If there is no cycle, returnnull.Follow up:Can you solve it without using extra space?Has... 阅读全文
posted @ 2015-01-24 14:51 雄哼哼 阅读(144) 评论(0) 推荐(0) 编辑
Linked List Cycle
摘要： Given a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?思路：1.可以用hash表记录链表中每个节点的地址，然后遍历发现重复，即有环，否则到... 阅读全文
posted @ 2015-01-24 14:23 雄哼哼 阅读(129) 评论(0) 推荐(0) 编辑
Triangle(dp)
摘要： Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the fol... 阅读全文
posted @ 2015-01-24 13:33 雄哼哼 阅读(161) 评论(0) 推荐(0) 编辑
2015年1月23日
Populating Next Right Pointers in Each Node （DFS，没想到）
摘要： Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate each next pointe... 阅读全文
posted @ 2015-01-23 21:38 雄哼哼 阅读(150) 评论(0) 推荐(0) 编辑
Flatten Binary Tree to Linked List (DFS)
摘要： Given a binary tree, flatten it to a linked list in-place.For example,Given 1 / \ 2 5 / \ \ 3 4 6The flattened t... 阅读全文
posted @ 2015-01-23 19:59 雄哼哼 阅读(186) 评论(0) 推荐(0) 编辑
Convert Sorted Array to Binary Search Tree
摘要： Given an array where elements are sorted in ascending order, convert it to a height balanced BST.思路比较简单，就是每次以中位数为根节点，然后左边即左子树，右边是右子树，递归下去即可超时代码（不知道为啥）... 阅读全文
posted @ 2015-01-23 17:54 雄哼哼 阅读(159) 评论(0) 推荐(0) 编辑
Unique Binary Search Trees（dp）
摘要： 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. 1... 阅读全文
posted @ 2015-01-23 17:19 雄哼哼 阅读(261) 评论(0) 推荐(0) 编辑
Binary Tree Inorder Traversal
摘要： Given a binary tree, return theinordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[1,3,2].Note... 阅读全文
posted @ 2015-01-23 16:05 雄哼哼 阅读(124) 评论(0) 推荐(0) 编辑
2015年1月22日
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.No... 阅读全文
posted @ 2015-01-22 18:35 雄哼哼 阅读(136) 评论(0) 推荐(0) 编辑
上一页 1 2 3 4 5 6 7 8 ··· 16 下一页