LeetCode Valid Anagram JAVA

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.

主要就是利用String的split方法来统计每个char出现的次数，很简单的实现如下：

public class Solution {    public boolean isAnagram(String s, String t) {        for(char i ='a'; i<='z'; i++){            String str = String.valueOf(i);            int sLength = ("*" + s + "*").split(str).length-1 ;            int tLength = ("*" + t + "*").split(str).length-1 ;            if(sLength != tLength){                return false;            }        }        return true;    }}