383. Ransom Note

383. Ransom Note

• 题目描述：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") -> falsecanConstruct("aa", "ab") -> falsecanConstruct("aa", "aab") -> true

• 题目大意：给定两个字符串，问是否可以用magazines字符串中的字符组成ransom note 字符串

• 代码

  package String;/*** @Author OovEver* @Date 2017/12/6 23:02*/public class LeetCode383 {  public boolean canConstruct(String ransomNote, String magazine) {      char[] record = new char[26];      for(int i=0;i<magazine.length();i++) {          record[magazine.charAt(i) - 'a']++;      }      for(int i=0;i<ransomNote.length();i++) {          if (record[ransomNote.charAt(i) - 'a'] < 1) {              return false;          }          record[ransomNote.charAt(i) - 'a']--;      }      return true;  }}