leetcode383. Ransom Note

    xiaoxiao2025-08-29  7

    class Solution { public: bool canConstruct(string ransomNote, string magazine) { int a[26]={0}; for(int i = 0;i < ransomNote.length(); i++) a[ransomNote[i]-'a']++; for(int i = 0;i < magazine.length(); i++) a[magazine[i]-'a']--; for(int i = 0;i < 26; i++) if(a[i] > 0) return false; return true; } };
    转载请注明原文地址: https://ju.6miu.com/read-1302098.html
    最新回复(0)