赎金信

383.赎金信

来源： LeetCode383. Ransom Note

题目描述

383. Ransom Note
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

Ransom 赎金
arbitrary 任意的

思路分析

不要求顺序只要求满足
可以采用桶装的方式
分别统计每个字母出现的次数然后进行比较

暴力

代码

class Solution {
#define SIZE(A) ((int)A.size())
#define LENGTH(A) ((int)A.length())
#define MP(A,B) make_pair(A,B)
#define PB(X) push_back(X)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,a) for(int i=0;i<(a);++i)
#define ALL(A) A.begin(),A.end()
using VI = vector<int>;
using VII = vector<VI>;
using VD = vector<double>;
typedef pair<int, int> PI;
public:
    bool canConstruct(string ransomNote, string magazine) {
        // 只包含小写字母
        VI arry(26,0);
        for(auto s:magazine){
            arry[s-'a']++;
        }
        for(auto r:ransomNote){
            if(!arry[r-'a']) return false;
            else arry[r-'a']--;
        }
        return true;
    }
};

算法分析

- 时间复杂度：O(m+n)
- 空间复杂度：O(1)

代码改进

简单题改进啥

今天膜拜了楼教主的代码，tql