String Matching: The Simple way to implement String Matching

于 2012-05-10 14:49:00 发布 · 56 阅读

本文介绍了一个简单的字符串匹配算法实现，该算法使用两个字符串的字符数组进行逐个比较，并记录匹配次数。当完整匹配到模式字符串时，算法会输出匹配部分并重置模式索引继续搜索。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

public static int match(String source, String pattern)
	{
	    char[] sourceArray = source.toCharArray() ;
	    char[] patternArray = pattern.toCharArray() ;
	    
	    int source_length = sourceArray.length ;
	    int pattern_length = patternArray.length ;
	    
	    int source_index = 0;
	    int pattern_index = 0;
	    int foundtimes = 0 ;
	    
	    while(source_index < source_length)
	    {
	    	
	        if(sourceArray[source_index]==patternArray[pattern_index]) //equals
	        {
	            
	            if(pattern_index == pattern_length-1)
			    {
	            	int start = source_index - pattern_index ;
	            	int end = source_index - pattern_index+pattern_length ;
	            	System.out.println(source.substring(start,end));
		        	
	            	foundtimes++ ;
		        	pattern_index = 0 ;
		        	
		        	continue ;
			    }
	            
	            source_index++;
	            pattern_index++;
	        }
	        else //not equals
	        {
	        	source_index = source_index - (pattern_index-1); 
	            pattern_index = 0;
	        }
	        
	    }//end while
	    
	    return foundtimes ;
	    
	}

Reference: http://saturnman.blog.163.com/blog/static/5576112010969957130/