MDGSF Software Engineer

[算法学习][leetcode] 383 Ransom Note

2017-09-02
mdgsf
Art

https://leetcode.com/problems/ransom-note/description/

题目

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

题目翻译

题目解析

参考答案

#include <iostream>
#include <string>
using namespace std;

class Solution {
public:
    bool canConstruct(string ransomNote, string magazine) {

        int aiANSI[128] = { 0 };
        for (char c : magazine)
        {
            aiANSI[c]++;
        }

        for (char c : ransomNote)
        {
            if (aiANSI[c] <= 0)
            {
                return false;
            }
            else
            {
                aiANSI[c]--;
            }
        }
        return true;
    }
};

int main()
{
    Solution o;
    cout << o.canConstruct("a", "b") << endl;
    cout << o.canConstruct("aa", "aab") << endl;
    return 0;
}

weixingongzhonghao

Similar Posts

Comments