Java code implementation of five classic string matching algorithms

Project Introduction

• This project decomposes the common written interview questions of major factories, traces the source to the underlying implementation principles of data structures and algorithms, and knows what they are.
• Establish a knowledge structure system for easy search, welcome more like-minded friends to join the project AlgorithmPractice, (issues and pull requests are welcome).

String matching algorithm:

• 1. BF (Brute-Force) algorithm
• 2. BM (Boyer-Moore) algorithm
• 3. RK (Rabin-Karp) algorithm
• 4. KMP (Knuth-Morris-Pratt) algorithm
• 5. Sunday algorithm

Start of text

1. BF (Brute-Force) algorithm

Due to the rush of preparation, I will attach the source code address of github for now, and the design ideas will be added later.

• Code implementation : BF
• Design ideas :
• Note :

2. BM (Boyer-Moore) algorithm

Due to the rush of preparation, I will attach the source code address of github for now, and the design ideas will be added later.

• Code implementation : BM
• Design ideas :
• Note :

3. RK (Rabin-Karp) algorithm

Due to the rush of preparation, I will attach the source code address of github for now, and the design ideas will be added later.

• Code implementation : RabinKarp
• Design ideas :
• Note :

4. KMP (Knuth-Morris-Pratt) algorithm

Due to the rush of preparation, I will attach the source code address of github for now, and the design ideas will be added later.

• Code implementation : KMP
• Design ideas :
• Note :

5. Sunday algorithm

Due to the rush of preparation, I will attach the source code address of github for now, and the design ideas will be added later.

• Code implementation : Sunday
• Design ideas :
• Note :