Maximum Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.
#面试刷题
该标签下的全部文章。
Min Adjustment Cost
给一个整数数组，调整每个数的大小，使得相邻的两个数的差小于一个给定的整数target，调整每个数的代价为调整前后的差的绝对值，求调整代价之和最小是多少。
Minimum Window Substring
Given a string S and a string T, find the minimum window in S which will contain all the characters in T in co
Minimum Subarray for Sum
给定一个由 n 个整数组成的数组和一个正整数 s ，请找出该数组中满足其和 ≥ s 的最小长度子数组。如果无解，则返回 -1。