豆腐脑是咸的

Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [−2,1,−3,4,−1,2,1,−5,4], the contiguous subarray [4,−1,2,1] ha

Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. merge two sorted lists那道题的升级版。 Source /** * Definition for singly-linked list. * public class

There are two sorted arrays A and B 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)). 参考:http://blog.youkuaiyun.com/yutianzui

Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times. You may assume that the array is non-empty and the majority element