Files
python/C++专题课程/到LeedCode刷题/leetcode基础篇/28.实现str-str.cpp
HuangHai 1f397eca87 'commit'
2025-08-30 18:35:01 +08:00

61 lines
2.2 KiB
C++
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

/*/*******************************************************************************
** **
** Jiedi(China nanjing)Ltd. **
** 创建:丁宋涛 夏曹俊,此代码可用作为学习参考 **
*******************************************************************************/
/*****************************FILE INFOMATION***********************************
**
** Project : 算法设计与编程实践---基于leetcode的企业真题库
** Contact : xiacaojun@qq.com
** 博客 : http://blog.csdn.net/jiedichina
** 视频课程 : 网易云课堂 http://study.163.com/u/xiacaojun
腾讯课堂 https://jiedi.ke.qq.com/
csdn学院 https://edu.csdn.net/course/detail/25037
** 51cto学院 http://edu.51cto.com/lecturer/index/user_id-100013755.html
** 老夏课堂 http://www.laoxiaketang.com
**
** 算法设计与编程实践---基于leetcode的企业真题库 课程群 :296249312 加入群下载代码和交流
** 微信公众号 : jiedi2007
** 头条号 : 夏曹俊
**
*****************************************************************************
//!!!!!!!!! 算法设计与编程实践---基于leetcode的企业真题库 课程 QQ群:296249312 下载代码和交流*/
/*
* @lc app=leetcode.cn id=28 lang=cpp
*
* [28] 实现strStr()
*/
#include <string>
using namespace std;
class Solution {
public:
int strStr(string haystack, string needle) {
if(needle.size() == 0)
return 0;
if(needle.size() >haystack.size())
return -1;
int i,j;
i = 0;
j = 0;
for(i=0;i<haystack.size();i++){
if(j == needle.size())
return i - needle.size();
if(haystack[i] == needle[j])
j++;
else{
i -= j;
j = 0;
}
}
//用来单个字母的时候,j++,j=1,i=1
if(j == needle.size())
return i - needle.size();
return -1;
}
};