LintCode 671 循环单词

本文介绍了一种算法,用于计算给定字典中不同循环单词集的数量。通过将字符串旋转并加入到Set集合中来判断重复,实现了高效地统计。

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

The words are same rotate words if rotate the word to the right by loop, and get another. Count how many different rotate word sets in dictionary.

E.g. picture and turepic are same rotate words.

["picture", "turepic", "icturep", "word", "ordw", "lint"]
return 3.

“picture”, “turepic”, “icturep” are same ratote words.
“word”, “ordw” are same too.
“lint” is the third word that different from the previous two words.
将每个String的变化串加进Set集合中,进行重复判断。
解一:

//671循环单词
    public static int countRotateWords(List<String> words){
        int count=0;
        Set<String> set=new HashSet<String>();
            for (int i = 0; i < words.size(); i++) {
                String string=words.get(i);
                if (!set.contains(string)) {
                    count++;
                    set.add(string);
                    String b=change(string);
                    while(!b.equals(string)){
                        set.add(b);
                        b=change(b);
                    }
                }
            }


        return count;
    }

    public static String change(String string){
        String aString=string.substring(string.length()-1)
        +string.substring(0,string.length()-1);
        return aString;
    }
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值