默认Attach to选择了Automatically determine the type of code to debug，显示Native Code。但附加进程到iexplore.exe断点无法命中。解决方法是手动选择Code Type Natvie。
分类：
系统相关 时间：
2014-10-23 16:10:11
阅读次数：
340
Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth...
分类：
其他好文 时间：
2014-10-23 15:39:15
阅读次数：
149
Given a linked list, determine if it has a cycle in it.
Follow up:
Can you solve it without using extra space?
关键点：1）判断链表是否有环。
2）一个小坑在判断root和root的next是否为空上。
3）可以看为追及问题。最关键的坑在判断快走（每次走2步的节点），走1步会...
分类：
其他好文 时间：
2014-10-23 00:03:10
阅读次数：
276
Given a string containing just the characters '(', ')', '{', '}', '[' and ']',
determine if the input string is valid.
The brackets must close in the correct order, "()" and "()[]{}" are
all va...
分类：
其他好文 时间：
2014-10-22 22:02:58
阅读次数：
227
Balanced Binary TreeGiven a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tre...
分类：
其他好文 时间：
2014-10-22 12:29:07
阅读次数：
171
Given a binary tree, determine if it is height-balanced.
For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never diffe...
分类：
其他好文 时间：
2014-10-22 01:06:01
阅读次数：
162
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.
For example,
"A man, a plan, a canal: Panama" is a palindrome.
"race a car" is not a...
分类：
其他好文 时间：
2014-10-21 23:16:15
阅读次数：
293
Given a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?注意，链表循环并不是尾指针和头指针相同，可能是在中间某一段形成一个环路，所以不能只判...
分类：
其他好文 时间：
2014-10-21 22:56:24
阅读次数：
335
[leetcode]Given a binary tree, determine if it is a valid binary search tree (BST)....
分类：
其他好文 时间：
2014-10-21 12:20:55
阅读次数：
176
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.Fo...
分类：
其他好文 时间：
2014-10-20 22:58:44
阅读次数：
305
