-
Notifications
You must be signed in to change notification settings - Fork 955
/
Stamping The Sequence
52 lines (44 loc) · 1.53 KB
/
Stamping The Sequence
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
/*
Company Tags : Let me know if you get it :-) (Any help will be highly appreciated)
Leetcode Link : https://leetcode.com/problems/stamping-the-sequence/
*/
class Solution {
public:
bool canReplace(string& stamp, string& target, int& pos) {
for(int i = 0; i<stamp.length(); i++) {
if(target[i+pos] != '?' && target[i+pos] != stamp[i])
return false;
}
return true;
}
void replaceChar(string& stamp, string& target, int& pos, int& count) {
for(int i = 0; i<stamp.length(); i++) {
if(target[i+pos] != '?') {
target[i+pos] = '?';
count++;
}
}
}
vector<int> movesToStamp(string stamp, string target) {
vector<int> result;
int count = 0;
vector<bool> visited(target.length(), false);
while(count != target.length()) {
bool isChanged = false;
for(int i = 0; i<=target.length()-stamp.length(); i++) {
if(!visited[i] && canReplace(stamp, target, i)) {
replaceChar(stamp, target, i, count);
isChanged = true;
result.push_back(i);
visited[i] = true;
if(count == target.length())
break;
}
}
if(!isChanged)
return {};
}
reverse(result.begin(), result.end());
return result;
}
};