CodeWars 关于字符串包含问题

Description:

Write function scramble(str1,str2) that returns true if a portion of str1 characters can be rearranged to match str2, otherwise returns false.

For example:
str1 is ‘rkqodlw’ and str2 is ‘world’ the output should return true.
str1 is ‘cedewaraaossoqqyt’ and str2 is ‘codewars’ should return true.
str1 is ‘katas’ and str2 is ‘steak’ should return false.

Only lower case letters will be used (a-z). No punctuation or digits will be included.
Performance needs to be considered

public class Scramblies {

    public static boolean scramble(String str1, String str2) {
        if (str2.length() > str1.length()) return false;
        for (String s: str2.split("")) {
          if (!str1.contains(s))  return false;
          str1 = str1.replaceFirst(s,"");
        }        

        return true;
    }
}

另一种实现方式

import java.util.HashMap;
import java.util.Map;

public class Scramblies {

    public static boolean scramble(String str1, String str2) {
        if (str1.length() < str2.length()) return false;
        Map requirements = new HashMap<>();
        for (char reqChar : str2.toCharArray()) {
            Integer count = requirements.get(reqChar);
            if (count == null) count = 0;
            requirements.put(reqChar, count + 1);
        }

        for (char foundChar : str1.toCharArray()) {
            Integer count = requirements.remove(foundChar);
            if (count == null) continue;
            if (count > 1) requirements.put(foundChar, count - 1);
        }
        return requirements.isEmpty();
    }
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值