比较两个字符串,取其中最大的重复字符串006

// 选出两个字符串中首个最大的重复字符串
    public String MaxRepeatStr(String str1,String str2){
        
        String longStr = "";
        String shortStr = "";
        if(str1.length() <= str2.length()){
            shortStr = str1;
            longStr = str2;
        } else{
            shortStr = str2;
            longStr = str1;
        }
        
        int i = shortStr.length();
        int j = 0;
        while(i>0){
            for(int k = 0;k<=j;k++){
                if (longStr.indexOf(shortStr.substring(k, i+k)) >= 0){
                    System.out.println("Has max String is " + shortStr.substring(k, i+k));
                    return shortStr.substring(k, i+k);
                }
            }
            
            i--;
            j++;
        }
        System.out.println("Didn't Has max String.");
        return "";
    }

//优化版
// 选出两个字符串中最大的重复字符串以及出现的次数
    public Map MaxAllRepeatStr(String str1,String str2){
        
        Map<String,Integer> map = new HashMap<>();
        
        String longStr = "";
        String shortStr = "";
        if(str1.length() <= str2.length()){
            shortStr = str1;
            longStr = str2;
        } else{
            shortStr = str2;
            longStr = str1;
        }
        
        int i = shortStr.length();
        int j = 0;
        boolean hasflag = false;
        while(i>0){
            for(int k = 0;k<=j;k++){
                //在for循环里,i是不变的,是本次循环中取得字符串长度
                // i+k == endIndex
                if (longStr.indexOf(shortStr.substring(k, i+k)) >= 0){
                    if(map.get(shortStr.substring(k, i+k)) != null){
                        map.put(shortStr.substring(k, i+k), map.get(shortStr.substring(k, i+k)) + 1);
                    } else{
                        map.put(shortStr.substring(k, i+k), 1);
                    }
                    hasflag = true;
                }
            }
            if(hasflag){
                return map;
            }
            
            i--;
            j++;
        }
        System.out.println("Didn't Has max String.");
        return map;
    }

 

转载于:https://www.cnblogs.com/ysloong/p/6381640.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值