摘要：
Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest l 阅读全文
摘要：
Merge two sorted (ascending) linked lists and return it as a new sorted list. The new sorted list should be made by splicing together the nodes of the 阅读全文
摘要：
Merge two given sorted integer array A and B into a new sorted integer array. A=[1,2,3,4] B=[2,4,5,6] return [1,2,2,3,4,4,5,6] 感觉和上一个题没啥区别 class Solut 阅读全文
摘要：
Given two sorted integer arrays A and B, merge B into A as one sorted array. A = [1, 2, 3, empty, empty], B = [4, 5] After merge, A will be filled as 阅读全文
摘要：
Given a collection of intervals, merge all overlapping intervals. Given intervals => merged intervals: [ [ [1, 3], [1, 6], [2, 6], => [8, 10], [8, 10] 阅读全文
摘要：
Given a unsorted array with integers, find the median of it. A median is the middle number of the array after it is sorted. If there are even numbers 阅读全文