forked from doocs/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution.cs
71 lines (65 loc) · 1.7 KB
/
Solution.cs
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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
using System.Linq;
public class Solution {
public string MinWindow(string s, string t) {
var dict = t.Distinct().ToDictionary(ch => ch, ch => 0);
var goalDict = t.GroupBy(ch => ch).ToDictionary(g => g.Key, g => g.Count());
var goal = goalDict.Count;
var minI = int.MaxValue;
var minJ = 0;
var i = 0;
var j = 0;
var current = 0;
while (true)
{
while (current < goal && i < s.Length)
{
if (dict.ContainsKey(s[i]))
{
if (++dict[s[i]] == goalDict[s[i]])
{
++current;
}
}
++i;
}
while (current == goal && j < s.Length)
{
if (dict.ContainsKey(s[j]))
{
if (dict[s[j]] == goalDict[s[j]])
{
break;
}
else
{
--dict[s[j]];
}
}
++j;
}
if (current == goal)
{
if (i - j < minI - minJ)
{
minI = i;
minJ = j;
}
--dict[s[j]];
--current;
++j;
}
else
{
break;
}
}
if (minI == int.MaxValue)
{
return string.Empty;
}
else
{
return s.Substring(minJ, minI - minJ);
}
}
}