LeetCode：383. Ransom Note

051104

题目

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

我的解题思路

这道题是查看字符串magazines是否包含了ransom note string，不管其出现的顺序只要每个字符及其次数能组会起来就行。因此，我们可以对magazines求一个map，存储其字符及其该字符出现的次数。之后再对ransom note string的字符进行判断，当ransom note string中出现该字符则减掉map中的数，若最后所有的字符对应的次数都大于等于0，则返回true，否则false。

class Solution {
public:bool canConstruct(string ransomNote, string magazine) {unordered_map<char, int> map(26);for (int i = 0; i < magazine.size(); ++i)++map[magazine[i]];for (int j = 0; j < ransomNote.size(); ++j)if (--map[ransomNote[j]] < 0)return false;return true;}
};

去看了大佬的解答，不用map之类的stl库实现，而是只用了string的函数。tql~


class Solution {
public:bool canConstruct(string ransomNote, string magazine) {for(char c: ransomNote){int found = magazine.find(c);if(found == string::npos){return false;}magazine[found] = ' ';  }return true;}
};

LeetCode：383. Ransom Note相关推荐

[LeetCode] NO.383 Ransom Note
[题目] Given  an  arbitrary  ransom  note  string  and  another  string  containing  letters from  all ...
LeetCode 383. Ransom Note
题目 : Given an arbitrary ransom note string and another string containing letters from all the magazi ...
Leetcode 383 Ransom Note
lc383 Ransom Note 两个for 第一个记录sourse字符串每种字母出现次数第二个看现有字母是否能够填满target 1 class Solution { 2 public bool ...
leetcode 383. Ransom Note（赎金票据）
Given two strings ransomNote and magazine, return true if ransomNote can be constructed by using the ...
383. Ransom Note/691. Stickers to Spell Word-- String, Map, back tracking-- 未完待续
383 easy 题,就是建立字母的hash 表看第一个String 是否能被第二个String 所构建 canConstruct("aa", "aab") ...
C#LeetCode刷题之#383-赎金信（Ransom Note）
问题该文章的最新版本已迁移至个人博客[比特飞],单击链接 https://www.byteflying.com/archives/3937 访问. 给定一个赎金信 (ransom) 字符串和一个杂志 ...
LeetCode之Ransom Note
1.题目 Given an arbitrary ransom note string and another string containing letters from all the magazi ...
LeetCode：二叉树相关应用
LeetCode:二叉树相关应用基础知识 617.归并两个二叉树题目 Given two binary trees and imagine that when you put one of the ...
LeetCode383. Ransom Note
Given  an  arbitrary  ransom  note  string  and  another  string  containing  letters from  all  the ...

LeetCode：383. Ransom Note

题目

我的解题思路

LeetCode：383. Ransom Note相关推荐

最新文章

热门文章