确定两串乱序同构

 1 import java.util.*;
 2 
 3 public class Same {
 4     public boolean checkSam(String stringA, String stringB) {
 5         // write code here
 6             if(stringA.length() != stringB.length())
 7             return false;
 8         int [] charhash = new int[256];
 9         char [] str = stringA.toCharArray();
10         for(char c : str)
11         {
12             ++charhash[c];
13         }
14         for(int i = 0 ;i < stringB.length();++i)
15         {
16             if(--charhash[(int)stringB.charAt(i)] < 0)
17                 return false;
18         }
19         return true;
20     }
21 }