LeetCode383. Ransom Note

最新推荐文章于 2024-11-12 21:59:57 发布

叶卡捷琳堡

最新推荐文章于 2024-11-12 21:59:57 发布

阅读量277

点赞数

文章标签：算法数据结构 leetcode c++ 面试

本文链接：https://blog.csdn.net/weixin_46841376/article/details/134116556

版权

文章讲述了如何使用哈希表（数组模拟）解决给定两个字符串（ransomNote和magazine）的问题，判断ransomNote是否能通过magazine中的字母唯一构造。通过统计magazine中每个字符出现的次数，然后逐个检查ransomNote中字符是否可用，若发现某个字符不足则返回false，否则返回true。

摘要由CSDN通过智能技术生成

文章目录

- 一、题目
- 二、题解

一、题目

Given two strings ransomNote and magazine, return true if ransomNote can be constructed by using the letters 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.

二、题解

使用数组模拟哈希表解决

class Solution {
public:
    bool canConstruct(string ransomNote, string magazine) {
        int n1 = ransomNote.length();
        int n2 = magazine.length();
        vector<int> chars(26,0);
        for(int i = 0;i < n2;i++){
            chars[magazine[i] - 'a']++; 
        }
        for(int i = 0;i < n1;i++){
            if(chars[ransomNote[i] - 'a'] == 0) return false;
            chars[ransomNote[i] - 'a']--;
        }
        return true;
    }
};