algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 03:34:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 0028.实现strStr.md

Browse Source
This commit is contained in:
fw_qaq
2022-10-25 22:35:54 +08:00
committed by GitHub
parent 84b4f26744
commit a582640c7a
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
problems/0028.实现strStr.md
View File

@ -1303,7 +1303,8 @@ impl Solution {
```rust ```rust
impl Solution { impl Solution {
pub fn get_next(mut next: Vec<i32>, s: &Vec<char>) -> Vec<i32> { pub fn get_next(next_len: usize, s: &Vec<char>) -> Vec<i32> {
let mut next = vec![-1; next_len];
let mut j = -1; let mut j = -1;
for i in 1..s.len() { for i in 1..s.len() {
while j >= 0 && s[(j + 1) as usize] != s[i] { while j >= 0 && s[(j + 1) as usize] != s[i] {
@ -1328,8 +1329,7 @@ impl Solution {
needle.chars().collect::<Vec<char>>(), needle.chars().collect::<Vec<char>>(),
); );
let mut j = -1; let mut j = -1;
let mut next = vec![-1; needle.len()]; let next = Self::get_next(needle.len(), &needle_chars);
next = Self::get_next(next, &needle_chars);
for (i, v) in haystack_chars.into_iter().enumerate() { for (i, v) in haystack_chars.into_iter().enumerate() {
while j >= 0 && v != needle_chars[(j + 1) as usize] { while j >= 0 && v != needle_chars[(j + 1) as usize] {
j = next[j as usize]; j = next[j as usize];