【LeetCode从零单排】No28 Implement strStr()

题目

Implement strStr().

Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.

代码

public class Solution {
    public int strStr(String haystack, String needle) {
        if( needle.length()==0) return 0;
        if(haystack.length()==0 ) return -1;
        char[] haystack_char=haystack.toCharArray();
        char[] needle_char=needle.toCharArray();
        
        for(int i=0;i=needle_char.length){    
                for(int j=0;j

代码下载:https://github.com/jimenbian/GarvinLeetCode


/********************************

* 本文来自博客  “李博Garvin“

* 转载请标明出处:http://blog.csdn.net/buptgshengod

******************************************/




你可能感兴趣的:(【LeetCode从零单排】No28 Implement strStr())