-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution936.cs
70 lines (59 loc) · 1.65 KB
/
Solution936.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
using System.Text;
using LeetCode.DataStructures;
namespace LeetCode.Solutions;
public class Solution936
{
/// <summary>
/// 936. Stamping The Sequence - Hard
/// <a href="https://leetcode.com/problems/stamping-the-sequence">See the problem</a>
/// </summary>
public int[] MovesToStamp(string stamp, string target)
{
var stampChars = stamp.ToCharArray();
var targetChars = target.ToCharArray();
var result = new List<int>();
bool Replace(int start)
{
bool replaced = false;
for (int i = 0; i < stampChars.Length; i++)
{
if (targetChars[start + i] == '?')
{
continue;
}
if (targetChars[start + i] != stampChars[i])
{
return false;
}
replaced = true;
}
if (replaced)
{
for (int i = 0; i < stampChars.Length; i++)
{
targetChars[start + i] = '?';
}
result.Add(start);
}
return replaced;
}
bool stamped;
do
{
stamped = false;
for (int i = 0; i <= targetChars.Length - stampChars.Length; i++)
{
stamped |= Replace(i);
}
} while (stamped);
for (int i = 0; i < targetChars.Length; i++)
{
if (targetChars[i] != '?')
{
return Array.Empty<int>();
}
}
result.Reverse();
return [.. result];
}
}