Leetcode 383. Ransom Note -- 判断magazine字符串中的字母能否组成ransomNote字符串，magazine中的每个字母只能用一次

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

 下面有3个方法，第三种是在Discuss中发现的，觉得很机智！！

package com.string;

import java.util.HashMap;
import java.util.Map;
import java.util.Set;

/**
 * Title:
 *
 * @Au