LeetCode oj 383. Ransom Note(哈希)

383. Ransom Note

 
  My Submissions
  • Total Accepted: 23593
  • Total Submissions: 52194
  • Difficulty: Easy
  • Contributors: Admin


Given
 an 
arbitrary
 ransom
 note
 string 
and 
another 
string 
containing 
letters from
 all 
the 
magazines,
 write 
a 
function 
that 
will 
return 
true 
if 
the 
ransom 
 note 
can 
be 
constructed 
from 
the 
magazines ; 
otherwise, 
it 
will 
return 
false. 



Each 
letter
 in
 the
 magazine 
string 
can
 only 
be
 used 
once
 in
 your 
ransom
 note.

Note:
You may assume that both strings contain only lowercase letters.

canConstruct("a", "b") -> false
canConstruct("aa", "ab") -> false
canConstruct("aa", "aab") -> true
给你两个字符串,问第一个字符串能不能由第二个字符串中的字符组成
水的不行,哈希存一下就行了。
public class Solution {
    public boolean canConstruct(String ransomNote, String magazine) {
        int hash_r[] = new int [256];
        int hash_m[] = new int [256];
        int len_r = ransomNote.length();
        int len_m = magazine.length();
        if(len_r > len_m)
            return false;
        for(int i=0;i<len_r;i++){
            hash_r[ransomNote.charAt(i)-'a']++;
        };
        for(int i=0;i<len_m;i++){
            hash_m[magazine.charAt(i)-'a']++;
        }
        int flag = 0;
        for(int i=0;i<len_r;i++){
            if(hash_m[ransomNote.charAt(i)-'a'] < hash_r[ransomNote.charAt(i)-'a']){
                flag = 1;
                break;
            }
        }
        if(flag == 1)
            return false;
        else
            return true;
    }
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值