LeetCode/Algorithms/MinimumWindowSubstring.cs at master · codeyu/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
// Source : https://leetcode.com/problems/minimum-window-substring/
// Author : codeyu
// Date : Tuesday, January 24, 2017 11:54:49 PM

/**********************************************************************************
*
*
* Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).
*
*
*
* For example,
* S = "ADOBECODEBANC"
* T = "ABC"
*
*
* Minimum window is "BANC".
*
*
*
* Note:
* If there is no such window in S that covers all characters in T, return the empty string "".
*
*
* If there are multiple such windows, you are guaranteed that there will always be only one unique minimum window in S.
*
*
**********************************************************************************/

using System;
using System.Collections.Generic;
using Algorithms.Utils;
namespace Algorithms
{
public class Solution076 {
    public static string MinWindow(string s, string t) {throw new NotImplementedException("TODO");

    }
}}