[leetcode]Sort-242. 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:
What if the inputs contain unicode characters? How would you adapt your solution to such case?

public void bubbleSort(char[] array) {  
    for(int i=0; i<array.length-1; i++){  
        for(int j=0; j<array.length-i-1; j++){  
            if(array[j]>array[j+1]){  
                char temp = array[j];  
                array[j] = array[j+1];  
                array[j+1] = temp;  
            }  
        }yi  
    }  
}