lintcode-easy-Compare Strings

Compare two strings A and B, determine whether A contains all of the characters in B.

The characters in string A and B are all Upper Case letters.

Example

For A = "ABCD"B = "ACD", return true.

For A = "ABCD"B = "AABC", return false.

Note

The characters of B in A are not necessary continuous or ordered.

 

这道题也没太多好说的,cracking code interview提过这种小技巧

public class Solution {
    /**
     * @param A : A string includes Upper Case letters
     * @param B : A string includes Upper Case letter
     * @return :  if string A contains all of the characters in B return true else return false
     */
    public boolean compareStrings(String A, String B) {
        // write your code here
        if(A == null)
            return false;
        
        if(B == null || B.length() == 0)
            return true;
        
        int[] count = new int[26];
        
        int lengthA = A.length();
        int lengthB = B.length();
        
        if(lengthB > lengthA)
            return false;
        
        for(int i = 0; i < lengthA; i++){
            count[A.charAt(i) - 'A']++;
        }
        
        for(int i = 0; i < lengthB; i++){
            count[B.charAt(i) - 'A']--;
            
            if(count[B.charAt(i) - 'A'] < 0)
                return false;
        }
        
        return true;
    }
}

 

转载于:https://www.cnblogs.com/goblinengineer/p/5212545.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值