给定两个数组A和B ，任务是使用Z算法为数组A中数组B每次出现找到起始索引。
例子：
Input: A = {1, 2, 3, 2, 3}, B = {2, 3}
Output: 1 3
Explanation:
In array A, array B occurs at index 1 and index 3. Thus the answer is {1, 3}.
Input: A = {1, 1, 1, 1, 1}, B = {1}
Output: 0 1 2 3 4
In array A, array B occur at the index {0, 1, 2, 3, 4}.
在Z算法中，我们构造了一个Z数组。
什么是Z阵列?
对于arr [0..n-1] ，Z数组是一个长度与字符串数组arr相同的数组，其中Z数组的每个元素Z [i]存储从arr [i]开始的最长子字符串的长度。也是arr [0..n-1]的前缀。 Z数组的第一个条目是没有意义的，因为完整数组始终是其自身的前缀。
例如：对于给定的数组arr [] = {1，2，3，0，1，2，3，5} 
方法：
- 合并数组B和数组A，并使用分隔符将它们合并到新数组C中。在这里，分隔符可以是任何特殊字符。
- 使用数组C创建Z数组。
- 遍历Z数组并打印所有大于或等于数组B长度的索引。
下面是上述方法的实现。
C++
// CPP implementation for pattern
// searching in an array using Z-Algorithm
#include
using namespace std;
// Function to calculate Z-Array
vector zArray(vector arr)
{
int n = arr.size();
vector z(n);
int r = 0, l = 0;
// Loop to calculate Z-Array
for (int k = 1; k < n; k++) {
// Outside the Z-box
if (k > r) {
r = l = k;
while (r < n
&& arr[r] == arr[r - l])
r++;
z[k] = r - l;
r--;
}
// Inside Z-box
else {
int k1 = k - l;
if (z[k1] < r - k + 1)
z[k] = z[k1];
else {
l = k;
while (r < n
&& arr[r] == arr[r - l])
r++;
z[k] = r - l;
r--;
}
}
}
return z;
}
// Helper function to merge two
// arrays and create a single array
vector mergeArray(vector A, vector B)
{
int n = A.size();
int m = B.size();
vector z;
// Array to store merged array
vector c(n + m + 1);
// Copying array B
for (int i = 0; i < m; i++)
c[i] = B[i];
// Adding a separator
c[m] = INT_MAX;
// Copying array A
for (int i = 0; i < n; i++)
c[m + i + 1] = A[i];
// Calling Z-function
z = zArray(c);
return z;
}
// Function to help compute the Z array
void findZArray(vectorA,vectorB, int n)
{
int flag = 0;
vector z;
z = mergeArray(A, B);
// Printing indexes where array B occur
for (int i = 0; i < z.size(); i++) {
if (z[i] == n) {
cout << (i - n - 1) << " ";
flag = 1;
}
}
if (flag == 0) {
cout << ("Not Found");
}
}
// Driver Code
int main()
{
vectorA{ 1, 2, 3, 2, 3, 2 };
vectorB{ 2, 3 };
int n = B.size();
findZArray(A, B, n);
}
// This code is contributed by Surendra_Gangwar Java
// Java implementation for pattern
// searching in an array using Z-Algorithm
import java.io.*;
import java.util.*;
class GfG {
// Function to calculate Z-Array
private static int[] zArray(int arr[])
{
int z[];
int n = arr.length;
z = new int[n];
int r = 0, l = 0;
// Loop to calculate Z-Array
for (int k = 1; k < n; k++) {
// Outside the Z-box
if (k > r) {
r = l = k;
while (r < n
&& arr[r] == arr[r - l])
r++;
z[k] = r - l;
r--;
}
// Inside Z-box
else {
int k1 = k - l;
if (z[k1] < r - k + 1)
z[k] = z[k1];
else {
l = k;
while (r < n
&& arr[r] == arr[r - l])
r++;
z[k] = r - l;
r--;
}
}
}
return z;
}
// Helper function to merge two
// arrays and create a single array
private static int[] mergeArray(int A[],
int B[])
{
int n = A.length;
int m = B.length;
int z[];
// Array to store merged array
int c[] = new int[n + m + 1];
// Copying array B
for (int i = 0; i < m; i++)
c[i] = B[i];
// Adding a separator
c[m] = Integer.MAX_VALUE;
// Copying array A
for (int i = 0; i < n; i++)
c[m + i + 1] = A[i];
// Calling Z-function
z = zArray(c);
return z;
}
// Function to help compute the Z array
private static void findZArray(int A[], int B[], int n)
{
int flag = 0;
int z[];
z = mergeArray(A, B);
// Printing indexes where array B occur
for (int i = 0; i < z.length; i++) {
if (z[i] == n) {
System.out.print((i - n - 1)
+ " ");
flag = 1;
}
}
if (flag == 0) {
System.out.println("Not Found");
}
}
// Driver Code
public static void main(String args[])
{
int A[] = { 1, 2, 3, 2, 3, 2 };
int B[] = { 2, 3 };
int n = B.length;
findZArray(A, B, n);
}
}Python3
# Python3 implementation for pattern
# searching in an array using Z-Algorithm
import sys;
# Function to calculate Z-Array
def zArray(arr) :
n = len(arr);
z = [0]*n;
r = 0;
l = 0;
# Loop to calculate Z-Array
for k in range(1, n) :
# Outside the Z-box
if (k > r) :
r = l = k;
while (r < n and arr[r] == arr[r - l]) :
r += 1;
z[k] = r - l;
r -= 1;
# Inside Z-box
else :
k1 = k - l;
if (z[k1] < r - k + 1) :
z[k] = z[k1];
else :
l = k;
while (r < n and arr[r] == arr[r - l]) :
r += 1 ;
z[k] = r - l;
r -= 1;
return z;
# Helper function to merge two
# arrays and create a single array
def mergeArray(A,B) :
n = len(A);
m = len(B);
# Array to store merged array
c = [0]*(n + m + 1);
# Copying array B
for i in range(m) :
c[i] = B[i];
# Adding a separator
c[m] = sys.maxsize;
# Copying array A
for i in range(n) :
c[m + i + 1] = A[i];
# Calling Z-function
z = zArray(c);
return z;
# Function to help compute the Z array
def findZArray( A,B, n) :
flag = 0;
z = mergeArray(A, B);
# Printing indexes where array B occur
for i in range(len(z)) :
if (z[i] == n) :
print(i - n - 1, end= " ");
flag = 1;
if (flag == 0) :
print("Not Found");
# Driver Code
if __name__ == "__main__" :
A = [ 1, 2, 3, 2, 3, 2];
B = [ 2, 3 ];
n = len(B);
findZArray(A, B, n);
# This code is contributed by AnkitRai01C#
// C# implementation for pattern
// searching in an array using Z-Algorithm
using System;
class GfG
{
// Function to calculate Z-Array
private static int[] zArray(int []arr)
{
int []z;
int n = arr.Length;
z = new int[n];
int r = 0, l = 0;
// Loop to calculate Z-Array
for (int k = 1; k < n; k++)
{
// Outside the Z-box
if (k > r)
{
r = l = k;
while (r < n
&& arr[r] == arr[r - l])
r++;
z[k] = r - l;
r--;
}
// Inside Z-box
else
{
int k1 = k - l;
if (z[k1] < r - k + 1)
z[k] = z[k1];
else
{
l = k;
while (r < n
&& arr[r] == arr[r - l])
r++;
z[k] = r - l;
r--;
}
}
}
return z;
}
// Helper function to merge two
// arrays and create a single array
private static int[] mergeArray(int []A,
int []B)
{
int n = A.Length;
int m = B.Length;
int []z;
// Array to store merged array
int []c = new int[n + m + 1];
// Copying array B
for (int i = 0; i < m; i++)
c[i] = B[i];
// Adding a separator
c[m] = int.MaxValue;
// Copying array A
for (int i = 0; i < n; i++)
c[m + i + 1] = A[i];
// Calling Z-function
z = zArray(c);
return z;
}
// Function to help compute the Z array
private static void findZArray(int []A, int []B, int n)
{
int flag = 0;
int []z;
z = mergeArray(A, B);
// Printing indexes where array B occur
for (int i = 0; i < z.Length; i++)
{
if (z[i] == n)
{
Console.Write((i - n - 1)
+ " ");
flag = 1;
}
}
if (flag == 0)
{
Console.WriteLine("Not Found");
}
}
// Driver Code
public static void Main()
{
int []A = { 1, 2, 3, 2, 3, 2 };
int []B = { 2, 3 };
int n = B.Length;
findZArray(A, B, n);
}
}
// This code is contributed by AnkitRai01输出：
1 3
时间复杂度： O(N + M)。