410. Split Array Largest Sum
https://leetcode.com/problems/split-array-largest-sum/
solution
Binary search
时间复杂度:O() 空间复杂度:O()
dynamic programming
follow up
二分搜索范围: [max(nums), sum(nums)]
类似背包搜索的范围,从每一个可选中检查
378. Kth Smallest Element in a Sorted Matrix
668. Kth Smallest Number in Multiplication Table
1011. Capacity To Ship Packages Within D Days
*774. Minimize Max Distance to Gas Station
brute force
binary search
heap
1482. Minimum Number of Days to Make m Bouquets
2141. Maximum Running Time of N Computers
Last updated