14. leetcode 383. Ransom Note

mac2022-06-30  68

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

思路:因为字符只包含小写英文字母,所以可以利用索引处理。相当于哈希表。

 

转载于:https://www.cnblogs.com/vincent93/p/6686523.html

最新回复(0)