摘要：
Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is one possible representatio... 阅读全文
posted @ 2015-05-19 23:57
TonyLuis
阅读(237)
评论(0)
推荐(0)
摘要：
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 @ 2015-05-19 21:47
TonyLuis
阅读(151)
评论(0)
推荐(0)
摘要：
Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing all ones and return its area.解题思路：求01矩阵中，全是1的子矩阵的最大面积。把矩阵按照每一行... 阅读全文
posted @ 2015-05-19 19:44
TonyLuis
阅读(155)
评论(0)
推荐(0)
摘要：
For example,Given height = [2,1,5,6,2,3],return 10.解题思路：参考Problem H: Largest Rectangle in a Histogram 第四种思路，或者翻译版Largest Rectangle in Histogram@LeetCo... 阅读全文
posted @ 2015-05-19 18:10
TonyLuis
阅读(165)
评论(0)
推荐(0)
摘要：
Given a sorted linked list, delete all duplicates such that each element appear only once. For example,Given 1->1->2, return 1->2.Given 1->1->2->3->3,... 阅读全文
posted @ 2015-05-19 12:44
TonyLuis
阅读(141)
评论(0)
推荐(0)
摘要：
Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. For example,Given 1->2... 阅读全文
posted @ 2015-05-19 12:29
TonyLuis
阅读(206)
评论(0)
推荐(0)
摘要：
Follow up for "Search in Rotated Sorted Array":What if duplicates are allowed?Would this affect the run-time complexity? How and why?Write a function ... 阅读全文
posted @ 2015-05-19 10:47
TonyLuis
阅读(139)
评论(0)
推荐(0)
浙公网安备 33010602011771号