https://leetcode.com/problems/linked-list-cycle-ii/Linked List Cycle IIGiven a linked list, return the node where the cycle begins. If there is no cyc...
分类：
其他好文 时间：
2015-07-01 11:48:59
阅读次数：
151
https://leetcode.com/problems/linked-list-cycle/Linked List CycleGiven a linked list, determine if it has a cycle in it.Follow up:Can you solve it wit...
分类：
其他好文 时间：
2015-07-01 11:42:40
阅读次数：
103
50 Pow(x, n)链接：https://leetcode.com/problems/powx-n/
问题描述：
Implement pow(x, n).Hide Tags Math Binary Search实现pow函数。这个问题可以用递归解决，联想到到 Binary Search，我的解决方案是每次让指数缩小两倍，当指数为技术的时候需要特别处理。还有指数为负的情况需要注意。class...
分类：
其他好文 时间：
2015-07-01 10:12:27
阅读次数：
104
https://leetcode.com/problems/swap-nodes-in-pairs/Swap Nodes in PairsGiven a linked list, swap every two adjacent nodes and return its head.For exampl...
分类：
其他好文 时间：
2015-07-01 09:51:57
阅读次数：
99
223 Rectangle Area链接：https://leetcode.com/problems/rectangle-area/
问题描述：
Find the total area covered by two rectilinear rectangles in a 2D plane.Each rectangle is defined by its bottom left corner...
分类：
其他好文 时间：
2015-06-30 16:24:49
阅读次数：
88
https://leetcode.com/problems/remove-nth-node-from-end-of-list/Remove Nth Node From End of ListGiven a linked list, remove thenthnode from the end of ...
分类：
其他好文 时间：
2015-06-30 10:18:00
阅读次数：
104
http://oj.leetcode.com/problems/minimum-depth-of-binary-tree/This question is pretty similar to the solution of Maximum Depth of Binary Tree, the only...
分类：
其他好文 时间：
2015-06-30 06:34:15
阅读次数：
138
https://leetcode.com/problems/add-two-numbers/You are given two linked lists representing two non-negative numbers. The digits are stored in reverse o...
分类：
其他好文 时间：
2015-06-29 23:36:10
阅读次数：
181
Today I finally got ruby debugging working in Eclipse. Below are the major setup steps involved, as well as some problems one might encounter along th...
分类：
其他好文 时间：
2015-06-29 22:12:15
阅读次数：
185
https://leetcode.com/problems/copy-list-with-random-pointer/Copy List with Random PointerA linked list is given such that each node contains an additi...
分类：
其他好文 时间：
2015-06-29 22:05:25
阅读次数：
121
