码迷,mamicode.com
首页 > 其他好文 > 详细

[leetcode-383-Ransom Note]

时间:2017-07-03 22:23:00      阅读:163      评论:0      收藏:0      [点我收藏+]

标签:com   rip   each   gen   ons   function   use   sum   warning   

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

 


 
Seen this question in a real interview before?   No
思路:
用一个map记录magazine里的字符以及个数,然后判断ransom里的字符是否能够用magazine里的表示。
bool canConstruct(string ransomNote, string magazine)
     {
         map<char, int>mpmag;
         for (auto ch : magazine)mpmag[ch]++;
         for (auto ch : ransomNote)
         {
             mpmag[ch]--;
             if (mpmag[ch] < 0)return false;             
         }
         return true;         
     }

 

[leetcode-383-Ransom Note]

标签:com   rip   each   gen   ons   function   use   sum   warning   

原文地址:http://www.cnblogs.com/hellowooorld/p/7112992.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!