题目描述
题目链接:https://leetcode-cn.com/problems/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.
解题思路
利用哈希表统计 字符出现的次数。以字符为key,以出现次数为value,共用一个统计数组。遍历s字符串,将当前遍历到的字符频次加一,同时在t中的字符频次减一。便利完成,看count中是否有小于0的值,如果有,返回false,否则返回true.
程序实现
public class Solution {
public boolean isAnagram(String s, String t) {
if(s==null||t==null)
return false;
if(s.length()!=t.length())
return false;
int [] count=new int[256];
Arrays.fill(count,0);
for(int i=0;i<s.length();i++) {
count[s.charAt(i)]++;
count[t.charAt(i)]--;
}
for(int i=0;i<t.length();i++)
if(count[t.charAt(i)]<0)
return false;
return true;
}
}