Categorygithub.com/szhou12/leetcode-goleetcode1392-Longest-Happy-Prefix
package
0.0.0-20241220224003-b7cf03a90b2b
Repository: https://github.com/szhou12/leetcode-go.git
Documentation: pkg.go.dev
Overview
Dependencies
0
Dependents
0

# README

1392. Longest Happy Prefix

Solution idea

KMP

思路总结

  1. KMP算法的第一步: preprocess()。找到 needle (pattern string) 的 longest suffix prefix lsp[]。流程见KMP动图。

Time complexity = $O(n)$

Resource

【每日一题】1392. Longest Happy Prefix, 2/2/2021