【leetcode】Valid Anagram

描述

Given two strings s and t, write a function to determine if t is an anagram of s.

For example,
s = "anagram", t = "nagaram", return true.
s = "rat", t = "car", return false.

Note:
You may assume the string contains only lowercase alphabets.

思路：

这个题目很简单，思路有三：

• cpp的hash表做
• 因为都是小写字母，直接用类似[s-'a']的数组做，可以加速
• 排序后直接比较