[Leetcode] Minimum window subsequence minimum Windows sequence

Given strings S T and, find the minimum (contiguous) substring W S of, so which is T a subsequence of c5/>.

If There is no such Windows S in this covers all characters T in, return the empty string "" . If There is multiple such minimum-length windows, return the one with the Left-most starting index.

Example 1:

input:s = "Abcdebdde", T = "BDE" Output: "BCDE" Explanation: "BCDE" is the answer because it occurs before "Bdde" which have The same length. " Deb "is a smaller window because the elements of T in the window must occur in order.

Note:

• All the strings in the input would be only contain lowercase letters.
• The length of'll is in the S range [1, 20000] .
• The length of'll is in the T range [1, 100] .

S

[Leetcode] Minimum window subsequence minimum Windows sequence