给定任意勒索信字符串和包含所有杂志字母的字符串，判断能否仅用杂志字母构建勒索信。每个杂志字母只能在勒索信中使用一次。题目要求只考虑小写字母。
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.
订阅专栏 解锁全文
扫一扫
203
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
