思路2： 先把T的每个字符和对应个数存入bucket数组，根据S的顺序扫一遍，最后再扫一遍剩余字符（非S中的字符）。
版权声明：本文为博主原创文章，未经博主允许不得转载。https://blog.csdn.net/Oct31_Dec25/article/details/79307636
Given a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters.
Implement a trie with insert, search, and startsWith methods. Note: You may assume that all inputs are consist of lowercase letters a-z. 实现字典树，包括插入、查询整词、查询...
LWC 53：691. Stickers to Spell Word传送门：691. Stickers to Spell WordProblem: We are given N differen
