字符串匹配的算法

 字符串匹配的算法.
public String getMaxMatch(String a,String b) {  
        StringBuffer tmp = new StringBuffer();  
        String maxString = "";  
        int max = 0;  
        int len = 0;  
        char[] aArray = a.toCharArray();  
        char[] bArray = b.toCharArray();  
        int posA = 0;  
        int posB = 0;  
        while(posA<aArray.length-max) {  
            posB = 0;  
            while(posB<(bArray.length-max)) {                                  
                 if(aArray[posA]==bArray[posB]) {  
                      len = 1;  
                      tmp = new StringBuffer();  
                      tmp.append(aArray[posA]);                                          
                      while((posA+len<aArray.length)&&(posB+len<bArray.length)&&(aArray[posA+len]==bArray[posB+len])) {  
                           tmp.append(aArray[posA+len]);  
                           len++;  
                      }  
                      if(len>max) {  
                            max = len;  
                            maxString = tmp.toString();  
                      }  
                 }  
                      posB++;  
            }  
                      posA++;  
         }          
            return maxString;                      
    }

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值