Implement strStr() (C,C++,Java,Python)

最新推荐文章于 2019-09-08 17:47:58 发布

NRlovestudy

最新推荐文章于 2019-09-08 17:47:58 发布

阅读量608

点赞数

分类专栏： JAVA

JAVA 专栏收录该内容

185 篇文章 0 订阅

订阅专栏

http://blog.csdn.net/runningtortoises/article/details/45667569

题目大意：

给两个字符串，求第二个字符串在第一个字符串中出现的最小位置，如果没有出现则输出-1

Java源代码（323ms）：

[java]view plaincopy 
    
 public class Solution {  
     public int strStr(String haystack, String needle) {  
         char[] chs1=haystack.toCharArray();  
         char[] chs2=needle.toCharArray();  
         int len1=chs1.length,len2=chs2.length;  
         int[] next=new int[len2+1];  
         getNext(chs2,next,len2);  
         int i=0,j=0;  
         while(i<len1 && j<len2){  
             if(j==-1 || chs1[i]==chs2[j]){  
                 i++;j++;  
             }else{  
                 j=next[j];  
             }  
         }  
         if(j<len2)return -1;  
         return i-len2;  
     }  
     private void getNext(char[] chs,int[] next,int len){  
         int i=0,j=-1;  
         next[0]=-1;  
         while(i<len){  
             if(j==-1 || chs[i]==chs[j]){  
                 i++;j++;  
                 next[i]=j;  
             }else{  
                 j=next[j];  
             }  
         }  
     }  
 }  

C语言源代码（2ms）：

[cpp]view plaincopy 
    
 void getNext(char *needle,int* next){  
     int i=0,j=-1;  
     next[0]=-1;  
     while(needle[i]){  
         if(j==-1 || needle[j]==needle[i]){  
             j++;  
             i++;  
             next[i]=j;  
         }else{  
             j=next[j];  
         }  
     }  
 }  
 int strStr(char* haystack, char* needle) {  
     int length=strlen(needle),i=0,j=0;  
     int *next=(int*)malloc(sizeof(int)*(length+1));  
     getNext(needle,next);  
     while(j==-1 || (haystack[i] && needle[j])){  
         if(j==-1 || haystack[i]==needle[j]){  
             j++;i++;  
         }else{  
             j=next[j];  
         }  
     }  
     if(needle[j])return -1;  
     else return i-length;  
 }  

C++源代码（8ms）：

[cpp]view plaincopy 
    
 class Solution {  
 public:  
     int strStr(string haystack, string needle) {  
         int len1=haystack.size(),len2=needle.size();  
         int* next=(int*)malloc(sizeof(int)*(len2+1));  
         getNext(needle,next,len2);  
         int i=0,j=0;  
         while(i<len1 && j<len2){  
             if(j==-1 || haystack[i]==needle[j]){  
                 i++;j++;  
             }else{  
                 j=next[j];  
             }  
         }  
         if(j<len2)return -1;  
         else return i-len2;  
     }  
 private:  
     void getNext(string needle,int* next,int len1){  
         int i=0,j=-1;  
         next[0]=-1;  
         while(i<len1){  
             if(j==-1 || needle[i]==needle[j]){  
                 j++;i++;  
                 next[i]=j;  
             }else{  
                 j=next[j];  
             }  
         }  
     }  
 };  

Python源代码（74ms）：

[python]view plaincopy 
    
 class Solution:  
     # @param {string} haystack  
     # @param {string} needle  
     # @return {integer}  
     def strStr(self, haystack, needle):  
         len1=len(haystack);len2=len(needle)  
         next=[-1 for i in range(len2+1)]  
         self.getNext(needle,next,len2)  
         i=0;j=0  
         while i<len1 and j<len2:  
             if j==-1 or haystack[i]==needle[j]:  
                 i+=1;j+=1  
             else:j=next[j]  
         if j<len2:return -1  
         else:return i-len2  
     def getNext(self,needle,next,len2):  
         i=0;j=-1  
         while i<len2:  
             if j==-1 or needle[i]==needle[j]:  
                 i+=1  
                 j+=1  
                 next[i]=j  
             else:j=next[j]  

http://www.programcreek.com/2012/12/leetcode-implement-strstr-java/

Java Solution 1 - Naive

public int strStr(String haystack, String needle) {
    if(haystack==null || needle==null)    
        return 0;
 
    if(needle.length() == 0)
        return 0;
 
    for(int i=0; i<haystack.length(); i++){
        if(i + needle.length() > haystack.length())
            return -1;
 
        int m = i;
        for(int j=0; j<needle.length(); j++){
            if(needle.charAt(j)==haystack.charAt(m)){
                if(j==needle.length()-1)
                    return i;
                m++;
            }else{
                break;
            }
 
        }    
    }   
 
    return -1;
}

Java Solution 2 - KMP

Check out this article to understand KMP algorithm.

public int strStr(String haystack, String needle) {
        if(haystack==null || needle==null)    
            return 0;
 
	int h = haystack.length();
	int n = needle.length();
 
	if (n > h)
		return -1;
	if (n == 0)
		return 0;
 
	int[] next = getNext(needle);
	int i = 0;
 
	while (i <= h - n) {
		int success = 1;
		for (int j = 0; j < n; j++) {
			if (needle.charAt(0) != haystack.charAt(i)) {
				success = 0;
				i++;
				break;
			} else if (needle.charAt(j) != haystack.charAt(i + j)) {
				success = 0;
				i = i + j - next[j - 1];
				break;
			}
		}
		if (success == 1)
			return i;
	}
 
	return -1;
}
 
//calculate KMP array
public int[] getNext(String needle) {
	int[] next = new int[needle.length()];
	next[0] = 0;
 
	for (int i = 1; i < needle.length(); i++) {
		int index = next[i - 1];
		while (index > 0 && needle.charAt(index) != needle.charAt(i)) {
			index = next[index - 1];
		}
 
		if (needle.charAt(index) == needle.charAt(i)) {
			next[i] = next[i - 1] + 1;
		} else {
			next[i] = 0;
		}
	}
 
	return next;
}