# divide-conquer

1/2ページ

## [LintCode] Merge K Sorted Lists [DC/Heap]

Problem Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. Example Given lists: [ 2->4->null, nu […]

## [LintCode] Sort List [分治]

Problem Sort a linked list in O(n log n) time using constant space complexity. Example Given 1-3->2->null

## [LintCode/LeetCode] Binary Tree Maximum Path Sum

Problem Given a binary tree, find the maximum path sum. The path may start and end at any node in the tree. Example Given the below binary tree: 1 / \ […]

## [LintCode/LeetCode] Balanced Binary Tree

Problem Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which […]

## [LintCode/LeetCode] Median of two Sorted Arrays

Problem There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays. Example Given A=[1,2,3,4,5,6] Naiv […]

## [LeetCode] Flatten Binary Tree to Linked List

Flatten Binary Tree to Linked List Flatten a binary tree to a fake “linked list” in pre-order traversal.Here we use the right pointer in T […]

## [LeetCode] Maximum Subarray

Problem Find the contiguous subarray within an array (containing at least one number) which has the largest sum. Example For example, given the array […]