LeetCode Ransom Note(字符串)

题意：给出两个字符串s1,s2 ，看s1是否可以由s2中的字符组成

具体代码如下：

public class Solution
{public boolean canConstruct(String ransomNote, String magazine){Map<Character, Integer> m = new HashMap<>();for (int i = 0; i < magazine.length(); i++) {if (m.containsKey(magazine.charAt(i))) {m.put(magazine.charAt(i), m.get(magazine.charAt(i)) + 1);} else {m.put(magazine.charAt(i), 1);}}for (int i = 0; i < ransomNote.length(); i++) {if (m.containsKey(ransomNote.charAt(i))) {int cnt = m.get(ransomNote.charAt(i));cnt--;if (cnt < 0) return false;m.put(ransomNote.charAt(i), cnt);} else {return false;}}return true;}
}

LeetCode Ransom Note(字符串)相关推荐

C#LeetCode刷题之#383-赎金信（Ransom Note）
问题该文章的最新版本已迁移至个人博客[比特飞],单击链接 https://www.byteflying.com/archives/3937 访问. 给定一个赎金信 (ransom) 字符串和一个杂志 ...
LeetCode：383. Ransom Note
051104 题目 Given an arbitrary ransom note string and another string containing letters from all the m ...
[LeetCode] NO.383 Ransom Note
[题目] Given  an  arbitrary  ransom  note  string  and  another  string  containing  letters from  all ...
Leetcode 383 Ransom Note
lc383 Ransom Note 两个for 第一个记录sourse字符串每种字母出现次数第二个看现有字母是否能够填满target 1 class Solution { 2 public bool ...
LeetCode 383. Ransom Note
题目 : Given an arbitrary ransom note string and another string containing letters from all the magazi ...
LeetCode之Ransom Note
1.题目 Given an arbitrary ransom note string and another string containing letters from all the magazi ...
C#LeetCode刷题-字符串
字符串篇 # 题名刷题通过率难度 3 无重复字符的最长子串 24.6% 中等 5 最长回文子串 22.4% 中等 6 Z字形变换 35.8% 中等 8 字符串转整数 (atoi) 15.3% 中 ...
LeetCode实战：字符串相乘
题目英文 Given two non-negative integers num1 and num2 represented as strings, return the product of num ...
LeetCode实战：字符串相加
题目英文 Given two non-negative integers num1 and num2 represented as string, return the sum of num1 and ...

LeetCode Ransom Note(字符串)

LeetCode Ransom Note(字符串)相关推荐

最新文章

热门文章