Strings is anagrams

Write a method to anagram(s,t) decide if strings is anagrams or not.

Determine whether the characters in the two strings are the same, i.e. whether they can be changed into the same string by changing the alphabetical order.

If true, returns False if it is not.

Clarification

What is anagram?
-Strings is anagram if they can be the the same after the order of characters.

Example

Given s = "abcd" , t = "dcab" , return true .
Given s = "ab" , t = "ab" , return true .
Given s = "ab" , t = "ac" , return false .

 Public classSolution {/**     * @params:the First String *@paramb:the Second String *@returntrue or False*/     Public BooleanAnagram (string s, String t) {if(S.length ()! =t.length ()) {            return false; }        int[] Count =New int[256];  for(inti = 0; I < s.length (); i++) {count[(int) S.charat (i)]++; }                 for(intj = 0; J < T.length (); J + +) {count[(int) T.charat (j)]--; if(Count[(int) T.charat (j)] < 0){                return false; }        }        return true; }};

Strings is anagrams