686. Repeated String Match

 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

#ifdef LOCAL
#include <bits/stdc++.h>
using namespace std;

// tree node stuff here...
#endif

static int __initialSetup = []()
{
    std::ios::sync_with_stdio(false);
    cin.tie(NULL);
    return 0;
}
();

// handle special cases first
// [], "", ...
// range of input?
class Solution
{
public:
    // S = A + A + ... + A
    // B is substring of S
    int repeatedStringMatch(string A, string B)
    {
        int lenA = A.length();
        int lenB = B.length();
        string S = A;
        int cnt = 1;

        // for every starting point of A
        for (int i = 0; i < lenA; i++) {
            bool ok = true;
            // we try to match B with S, append if needed
            for (int j = 0; j < lenB; j++) {
                if (i + j < (int)S.length() && B[j] == S[i + j])
                    continue;
                else if (i + j < (int)S.length()) {
                    ok = false;
                    break;
                } else {
                    S += A;
                    cnt++;
                    j--;
                }
            }

            if (ok)
                return cnt;
        }

        return -1;
    }
};

#ifdef LOCAL
int main()
{
    return 0;
}
#endif