How to solve the problem of independent substrings in Java loop strings

The knowledge of this article "how to solve the independent substring problem in the Java circular string" is not quite understood by most people, so the editor summarizes the following content, detailed content, clear steps, and has a certain reference value. I hope you can get something after reading this article. Let's take a look at this "how to solve the independent substring problem in the Java circular string" article.

The title description assumes that s is an infinite loop of the string "abcdefghijklmnopqrstuvwxyz", and s is a ".Zabcdefghijklmnopqrstuvwxyza." Such a string, now give you another string p, find out how many different substrings exist in p, so that they are also substrings of s. P includes only lowercase letters in English and its length may be greater than 10000. Sample illustration

Enter: a

Output: 1

Description: only'a'is a substring of s.

Input: cac

Output: 2

Description: only'a 'and' c 'are substrings of s.

Input: zab

Output: 6

Explanation: 'zonal grammar' is a substring of s.

Code:

The above is about the content of this article on "how to solve the problem of independent substrings in the Java loop string". I believe we all have some understanding. I hope the content shared by the editor will be helpful to you. If you want to know more about the relevant knowledge, please follow the industry information channel.