#递归和动态规划
该标签下的全部文章。
Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters.
Maximal Rectangle
Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing all ones and return it
Max Square
Given a 2D binary matrix filled with 0's and 1's, find the largest square containing all 1's and return its ar
Max Sum Subarray Index
给定一个整数数组，请找出一个连续子数组，使得该子数组的和最大。输出答案时，请分别返回第一个数字和最后一个数字的值。（如果两个相同的答案，请返回其中任意一个）
Maximum Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.
Min Adjustment Cost
给一个整数数组，调整每个数的大小，使得相邻的两个数的差小于一个给定的整数target，调整每个数的代价为调整前后的差的绝对值，求调整代价之和最小是多少。