#递归和动态规划
该标签下的全部文章。
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。
Paint Fill
Implement the paint fill function that one might see on many image editing programs.