FilesExpand file tree

 master

/

RepeatedStringMatch686.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

60 lines (55 loc) · 1.77 KB

 master

/

RepeatedStringMatch686.java

Copy path

Top

File metadata and controls

• Code
• Blame

60 lines (55 loc) · 1.77 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

/**

* Given two strings A and B, find the minimum number of times A has to be

* repeated such that B is a substring of it. If no such solution, return -1.

*

* For example, with A = "abcd" and B = "cdabcdab".

*

* Return 3, because by repeating A three times (“abcdabcdabcd”), B is a

* substring of it; and B is not a substring of A repeated two times ("abcdabcd").

*

* Note:

* The length of A and B will be between 1 and 10000.

*/

public class RepeatedStringMatch686 {

public int repeatedStringMatch(String A, String B) {

int lenA = A.length();

int lenB = B.length();

for (int i=0; i<lenA; i++) {

if (A.charAt(i) == B.charAt(0)) {

int bi = 0;

int ai = i;

int nr = 1;

boolean found = true;

while (bi < lenB) {

char bc = B.charAt(bi);

char ac = A.charAt(ai);

if (ac != bc) {

found = false;

break;

}

bi++;

if (bi == lenB) break;

if (ai == lenA - 1) {

ai = 0;

nr++;

} else {

ai++;

}

}

if (found) return nr;

}

}

return -1;

}

/**

* https://leetcode.com/problems/repeated-string-match/solution/

*/

public int repeatedStringMatch2(String A, String B) {

int q = 1;

StringBuilder S = new StringBuilder(A);

for (; S.length() < B.length(); q++) S.append(A);

if (S.indexOf(B) >= 0) return q;

if (S.append(A).indexOf(B) >= 0) return q+1;

return -1;

}

}