-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSolution.cs
More file actions
76 lines (67 loc) · 1.9 KB
/
Solution.cs
File metadata and controls
76 lines (67 loc) · 1.9 KB
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
72
73
74
75
76
public class Solution
{
public int LongestBalanced(string s)
{
// 1 distinct character
int len = FindOneDistinct(s);
// 2 distinct characters
len = Math.Max(len, FindTwoDistinct('a', 'b', 'c', s));
len = Math.Max(len, FindTwoDistinct('a', 'c', 'b', s));
len = Math.Max(len, FindTwoDistinct('b', 'c', 'a', s));
// 3 distinct characters
len = Math.Max(len, FindThreeDistinct(s));
return len;
}
int FindOneDistinct(string s)
{
int n = s.Length;
int len = 0;
int count = 1;
for (int i = 1; i < n; i++)
{
if (s[i] == s[i - 1]) count++;
else count = 1;
len = Math.Max(len, count);
}
return Math.Max(len, count);
}
int FindTwoDistinct(char a, char b, char c, string s)
{
int n = s.Length;
int len = 0;
int count = 0;
Dictionary<int, int> map = [];
map[count] = -1;
for (int i = 0; i < n; i++)
{
if (s[i] == c)
{
count = 0;
map.Clear();
map[count] = i;
continue;
}
if (s[i] == a) count++;
else if (s[i] == b) count--;
if (map.TryGetValue(count, out int value)) len = Math.Max(len, i - value);
else map[count] = i;
}
return len;
}
int FindThreeDistinct(string s)
{
int len = 0;
int n = s.Length;
int[] count = new int[3];
Dictionary<(int, int), int> map = [];
map[(0, 0)] = -1;
for (int i = 0; i < n; i++)
{
count[s[i] - 'a']++;
var key = (count[0] - count[1], count[1] - count[2]);
if (map.TryGetValue(key, out int value)) len = Math.Max(len, i - value);
else map[key] = i;
}
return len;
}
}