Leetcode_hard
关注
分享
扫一扫
文章平均质量分 78
simplify2012
这个作者很懒，什么都没留下…
展开
-
[Leetcode 126 & 127, hard & medium] Word Ladder II & I
[Leetcode 126 & 127, hard & medium] Word Ladder II & I原创 2015-04-05 01:03:08 · 572 阅读 · 0 评论 -
[Leetcode 52, Hard] N Queens II
[Leetcode 52, Hard] N Queens II原创 2015-07-21 02:29:35 · 326 阅读 · 0 评论 -
[Leetcode 57, Hard] Insert Interval
[Leetcode 57, Hard] Insert Interval原创 2015-07-20 23:01:35 · 454 阅读 · 0 评论 -
[Leetcode 51, hard] N-Queens I
[Leetcode 51 & 52, hard] N-Queens I原创 2015-04-05 19:10:09 · 475 阅读 · 0 评论 -
[Leetcode 117, Hard] Populating Next Right Pointers in Each Node II
[Leetcode 117, Hard] Populating Next Right Pointers in Each Node II原创 2015-07-22 22:05:51 · 358 阅读 · 0 评论 -
[Leetcode 25, hard] Reverse Nodes in k-Group
[Leetcode 25, hard] Reverse Nodes in k-Group原创 2013-11-06 08:37:50 · 666 阅读 · 0 评论 -
[Leetcode 47, Hard] Permutations II
[Leetcode 47, Hard] Permutations II原创 2015-08-03 23:44:05 · 465 阅读 · 0 评论 -
[Leetcode 154, Hard] Find Minimum in Rotated Sorted Array II
[Leetcode 154, Hard] Find Minimum in Rotated Sorted Array II原创 2015-07-24 08:28:11 · 437 阅读 · 0 评论 -
[Leetcode 123, Hard] Best Time to Buy and Sell Stock III
[Leetcode 123, Hard] Best Time to Buy and Sell Stock III原创 2015-07-24 08:40:45 · 408 阅读 · 0 评论 -
[Leetcode 239, Hard] Sliding Window Maximum
[Leetcode 239, Hard] Sliding Window Maximum原创 2015-07-23 20:35:34 · 524 阅读 · 0 评论 -
[Leetcode 135, Hard] Candy
[Leetcode 135, hard] Candy原创 2013-11-07 03:33:00 · 817 阅读 · 0 评论 -
[Leetcode 164, Hard] Maximal Gap
[Leetcode 164, Hard] Maximal Gap原创 2015-07-20 23:04:37 · 507 阅读 · 0 评论 -
[Leetcode 145, Hard] Binary Tree Postorder Traversal
[Leetcode 145, Hard] Binary Tree Postorder Traversal原创 2015-07-20 09:20:05 · 347 阅读 · 0 评论 -
[Leetcode 56, Hard] Merge intervals
[Leetcode 56, Hard] Merge intervals原创 2013-11-10 05:56:51 · 851 阅读 · 0 评论 -
[Leetcode 33, Hard] Search in Rotated Sorted Array
[Leetcode 33, Hard] Search in Rotated Sorted Array原创 2015-04-23 13:37:45 · 457 阅读 · 0 评论 -
[Leetcode 23, Hard] Merge k Sorted Lists
[Leetcode 23, Medium] Merge k Sorted Lists原创 2015-05-10 09:34:09 · 425 阅读 · 0 评论 -
[Leetcode 45, Hard] Jump Game II
[Leetcode 45, Hard] Jump Game原创 2015-05-09 16:42:19 · 447 阅读 · 0 评论 -
[Leetcode 42, Hard] Trapping Rain Water
[Leetcode 42, Hard] Trapping Rain Water原创 2015-07-06 07:37:37 · 441 阅读 · 0 评论 -
[Leetcode 30, Hard] Substring with Concatenation of All Words
[Leetcode 30, Hard] Substring with Concatenation of All Words原创 2015-07-27 04:14:07 · 379 阅读 · 0 评论 -
[Leetcode 44, Hard] Wildcard match
[Leetcode 44, Hard] Wildcard match原创 2015-07-27 08:09:20 · 781 阅读 · 0 评论 -
[Leetcode 10, Hard] Regular Expression Matching
[Leetcode 10, Hard] Regular Expression Matching原创 2015-07-27 04:59:30 · 432 阅读 · 0 评论 -
[Leetcode 124, Hard] Binary Tree Maximum Path Sum
[Leetcode 124, Hard] Binary Tree Maximum Path Sum原创 2015-07-27 08:03:34 · 483 阅读 · 0 评论 -
[Leetcode 68, Hard] Text Justification
[Leetcode 68, Hard] Text Justification原创 2015-07-27 08:15:14 · 865 阅读 · 0 评论 -
[leetcde 212, Hard] Word Search II
[leetcde 212, Hard] Word Search II原创 2015-07-30 07:11:25 · 846 阅读 · 2 评论 -
[4, Hard, C++] Median of Two Sorted Arrays
Problem:There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).Analysis:原创 2016-02-13 08:22:53 · 519 阅读 · 0 评论