383. Ransom note Finding an array of notes in a dictionary array

[Copy question]:

Given an arbitrary ransom note string and another string containing letters from all the magazines, write a function that Would return true if the ransom note can be constructed from the magazines; Otherwise, it'll return false.

The magazine string can is used once in your ransom note.

Note:
You may assume this both strings contain only lowercase letters.

Canconstruct ("A", "B")-Falsecanconstruct ("AA", "AB"), falsecanconstruct ("AA", "AaB"), True

[Brute force solution]:

Time Analysis:

Spatial Analysis:

[After optimization]:

Time Analysis:

Spatial Analysis:

[Wonderful output CONDITIONS]:

[Wonderful corner case]:

[Thinking questions]:

Think to find the beginning of the note, the end point: no need, too much trouble, rather than traverse, indicating that each letter is checked

[a sentence of thought]:

[input]: null: Normal: Large: Extra Small: Special cases handled in the program: abnormal conditions (unreasonable input):

[Drawing]:

[One brush]:

[Two brushes]:

[Three brushes]:

[Four brushes]:

[Five brushes]:

[Results of five-minute visual debug]:

[Summary]:

[Complexity]:time Complexity:o () Space complexity:o ()

[English data structure or algorithm, why not other data structures or algorithms]:

INT[26] Although it is an array of numbers, it is possible to count the number of letters appearing, and string problems commonly used

[Key templating code]:

[Other solutions]:

[Follow up]:

[The problem given by the LC becomes variable]:

[Code Style]:

383. Ransom Note To find an array of notes in a dictionary array