string/zalgorithm.hpp

• View this file on GitHub
• Last update: 2022-04-16 04:26:49+09:00
• Include: #include "string/zalgorithm.hpp"

Required by

• seq/interpolate_periodic_sequence.hpp
• string/is_substring.hpp
• string/run_enumerate.hpp

Verified with

• test/library_checker/string/run_enumerate.test.cpp
• test/library_checker/string/run_enumerate_vec.test.cpp
• test/library_checker/string/zalgorithm.test.cpp
• test/mytest/is_substring.test.cpp
• test/yukicoder/1848.test.cpp
• test/yukicoder/2626_2.test.cpp
• test_atcoder/abc237ex.test.cpp
• test_atcoder/abc279b.test.cpp

Code

template <typename STRING>  // string, vector どちらでも
vector<int> zalgorithm(const STRING& s) {
  int n = int(s.size());
  if (n == 0) return {};
  vector<int> z(n);
  z[0] = 0;
  for (int i = 1, j = 0; i < n; i++) {
    int& k = z[i];
    k = (j + z[j] <= i) ? 0 : min(j + z[j] - i, z[i - j]);
    while (i + k < n && s[k] == s[i + k]) k++;
    if (j + z[j] < i + z[i]) j = i;
  }
  z[0] = n;
  return z;
}

#line 1 "string/zalgorithm.hpp"
template <typename STRING>  // string, vector どちらでも
vector<int> zalgorithm(const STRING& s) {
  int n = int(s.size());
  if (n == 0) return {};
  vector<int> z(n);
  z[0] = 0;
  for (int i = 1, j = 0; i < n; i++) {
    int& k = z[i];
    k = (j + z[j] <= i) ? 0 : min(j + z[j] - i, z[i - j]);
    while (i + k < n && s[k] == s[i + k]) k++;
    if (j + z[j] < i + z[i]) j = i;
  }
  z[0] = n;
  return z;
}

Back to top page