LeetCode in Net

383. Ransom Note

Easy

Given two stings ransomNote and magazine, return true if ransomNote can be constructed from magazine and false otherwise.

Each letter in magazine can only be used once in ransomNote.

Example 1:

Input: ransomNote = “a”, magazine = “b”

Output: false

Example 2:

Input: ransomNote = “aa”, magazine = “ab”

Output: false

Example 3:

Input: ransomNote = “aa”, magazine = “aab”

Output: true

Constraints:

• 1 <= ransomNote.length, magazine.length <= 105
• ransomNote and magazine consist of lowercase English letters.

Solution

public class Solution {
    public bool CanConstruct(string ransomNote, string magazine) {
        int[] count = new int[26];
        foreach (char c in magazine) count[c - 'a']++;
        foreach (char c in ransomNote) {
            if (--count[c - 'a'] < 0) return false;
        }
        return true;
    }
}

This site is open source. Improve this page.