We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 2dc2b19 commit 79a51a8Copy full SHA for 79a51a8
scripts/algorithms/R/Repeated String Match/Repeated String Match.cpp
@@ -1,23 +1,23 @@
1
+// Runtime: 246 ms (Top 22.18%) | Memory: 480.2 MB (Top 5.04%)
2
class Solution {
3
public:
4
int repeatedStringMatch(string a, string b) {
5
int m=a.size(); int n=b.size();
6
vector<int>d; int mod=n%m; int h=n/m;
-
7
+
8
if(mod==0)
- {d.push_back(h); d.push_back(h+1); }
9
- else
+ {d.push_back(h); d.push_back(h+1); }
10
+ else
11
{ d.push_back(h+1); d.push_back(h+2); }
12
string s=""; string t="";
13
14
for(int i=0;i<d[0];i++)
15
{s+=a;}
16
for(int i=0;i<d[1];i++)
17
{t+=a;}
18
19
int i=0; int y1=s.size()-n; int y2=t.size()-n;
20
21
while(i<=y1)
22
{
23
string x=s.substr(i,n); //cout<<x;
@@ -32,6 +32,6 @@ class Solution {
32
i++;
33
}
34
return -1;
35
36
37
-};
+};
0 commit comments