[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.

给两个字符串，问是否用的字母以及个数一样。

因为都是小写字母，开两个数组装下最后比较即可（下面的Follow up的解决可以用上map）

附上代码：

public class Solution {
public boolean isAnagram(String s, String t) {
if(s.length() != t.length()) return false;
if(s == "" && t == "") return true;
int arr[] = new int[26];
int arrTmp[] = new int[26];
int i;
for(i = 0; i < 26; i++){
arr[i] = 0;
arrTmp[i] = 0;
}
for(i = 0; i < s.length(); i++){
arr[s.charAt(i) - 'a'] ++;
arrTmp[t.charAt(i) - 'a'] ++;
}
boolean flag = true;
for(i = 0; i < 26; i++){
if(arr[i] != arrTmp[i]){
flag = false;
break;
}
}
return flag;
}
}

题目链接：https://leetcode.com/problems/valid-anagram/