ljffdream的专栏

[题目] 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)). [分析] [code

【题目】 Largest Rectangle in Histogram  Total Accepted: 42804 Total Submissions: 188970My Submissions Question  Solution  Given n non-negative integers representing the histogram

【题目】 Given a collection ofintervals, merge all overlapping intervals. For example, Given [1,3],[2,6],[8,10],[15,18], return [1,6],[8,10],[15,18]. 【思路】 思路就是，先对进来的这一个list 的inteval进行比较，排序，排序的时候

【题目】 Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. You

【题目】  Given n non-negative integers representing anelevation map where the width of each bar is 1, compute how much water it isable to trap after raining. For example,  Given [0,1,0,2,1,0,1,3,2,1

【题目】 Given an unsorted integer array, find the first missing positive integer. For example, Given [1,2,0] return 3, and [3,4,-1,1] return 2. Your algorithm should run in O(n) time and us

【题目】 Merge k sorted Linked Lists and return it as one sorted lists. Analyze and describe its complexity . 【思路】 leetcode clean book 【代码】 private static final Comparator listComparator = new

[题目] median 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 to determine if a given tar

【题目】 Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). Find the minimum element. You may assume no duplicate

【题目】 Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing all ones and return its area. 【思路】 只能说不明觉厉： The DP solution proceeds row by row, starting f