383_ransom_note.py

class Solution:
    def canConstruct(self, ransomNote: str, magazine: str) -> bool:
        chs_dict = {}
        for i in range(len(magazine)):
            if magazine[i] not in chs_dict:
                chs_dict[magazine[i]] = 1
            else:
                chs_dict[magazine[i]] += 1
        ans = False
        for i in range(len(ransomNote)):
            if ransomNote[i] in chs_dict:
                if chs_dict[ransomNote[i]] == 1:
                    del chs_dict[ransomNote[i]]
                else:
                    chs_dict[ransomNote[i]] -= 1
            else:
                break
        else:
            ans = True
        return ans

'''
    This is my personal record of solving Leetcode Problems. 
    If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
    Copyright (C) 2020-2022  mengxinayan

    This program is free software: you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.

    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with this program.  If not, see <http://www.gnu.org/licenses/>.
'''