forked from garvit-bhardwaj/Leetcode-Problems-Solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathStamping The Sequence
105 lines (43 loc) · 1.35 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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
class Solution {
public:
bool canReplace(string &stamp,string &target,int pos){
int m=stamp.size(),n=target.size();
for(int i=0;i<m;i++){
if(target[i+pos]!='?' and target[i+pos]!=stamp[i])
return false;
}
return true;
}
int replace(string &stamp,string &target,int pos){
int cnt=0;
int m=stamp.size(),n=target.size();
for(int i=0;i<m;i++){
if(target[i+pos]!='?'){
cnt++;
target[i+pos]='?';
}
}
return cnt;
}
vector<int> movesToStamp(string stamp, string target) {
vector<int> ans;
int m=stamp.size(),n=target.size();
int count=0;
vector<int> vis(n+1,0);
while(count!=n){
bool flag=false;
for(int i=0;i<=n-m;i++){
if(!vis[i] and canReplace(stamp,target,i)){
vis[i]=1;
count+=replace(stamp,target,i);
flag=true;
ans.push_back(i);
if(count==n) break;
}
}
if(!flag) return {};
}
reverse(ans.begin(),ans.end());
return ans;
}
};