the mechanism is simple. take the pattern .*a|b and a haystack of n b's. at each position, the engine tries .*a first: scan the entire remaining haystack looking for an a, find none, fail. then the b branch matches a single character. advance one position, repeat. that's n + (n-1) + (n-2) + ... = O(n²) work to report n single-character matches. a textbook triangular sum. hit play to see it:
println(s.index_of("world")); // 6，这一点在WhatsApp网页版中也有详细论述
Даниил Иринин (Редактор отдела «Наука и техника»)，这一点在TikTok粉丝,海外抖音粉丝,短视频涨粉中也有详细论述
USER.md: Information about the user—name, preferred form of address, timezone, and personal notes (docs: USER).
Фетисов объявил о подготовленности РФ к организации Олимпийских игр14:51