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

Merge pull request #2048 from CharlieZJJ/master

Browse Source 
更新 0028.实现strStr Rust版本多余代码删除
This commit is contained in:
程序员Carl
2023-05-10 09:27:09 +08:00
committed by GitHub
parent c736dda0af 9558af957b
commit 9d171aaadd
1 changed files with 0 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -1293,7 +1293,6 @@ impl Solution {
pub fn str_str(haystack: String, needle: String) -> i32 { pub fn str_str(haystack: String, needle: String) -> i32 {
let (haystack_len, needle_len) = (haystack.len(), needle.len()); let (haystack_len, needle_len) = (haystack.len(), needle.len());
if haystack_len == 0 { return 0; }
if haystack_len < needle_len { return -1;} if haystack_len < needle_len { return -1;}
let (haystack, needle) = (haystack.chars().collect::<Vec<char>>(), needle.chars().collect::<Vec<char>>()); let (haystack, needle) = (haystack.chars().collect::<Vec<char>>(), needle.chars().collect::<Vec<char>>());
let mut next: Vec<usize> = vec![0; haystack_len]; let mut next: Vec<usize> = vec![0; haystack_len];
@ -1334,9 +1333,6 @@ impl Solution {
next next
} }
pub fn str_str(haystack: String, needle: String) -> i32 { pub fn str_str(haystack: String, needle: String) -> i32 {
if needle.is_empty() {
return 0;
}
if haystack.len() < needle.len() { if haystack.len() < needle.len() {
return -1; return -1;
} }