poj 2159 java

     这是前几天做的，不算做完，只能算运行成功，因为运行时间挺久的，严重超时,要注意

import java.io.*;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;

public class Main{
    public static void main(String args[]){
        
        BufferedReader read = new BufferedReader(new InputStreamReader(System.in));
        
        String source,cipher;
        char[] c1,c2;
        boolean flag=true;
        
        try{
        
        while((cipher=read.readLine())!=null){
            source = read.readLine();
            
            c1  = cipher.toCharArray();
            c2  = source.toCharArray();
            
            List<Integer> list1 = getList(c1);
            List<Integer> list2 = getList(c2);
            
            
            if(list1.size() != list2.size()){
                flag = false;
            }else{
                
                for(int i=0;i<list1.size();i++){
                    
                    Collections.sort(list1);
                    Collections.sort(list2);
                    
                    if(list1.get(i)!=list2.get(i)){
                        flag = false;
                        break;
                    }
                }                
            }
            
            if(flag){
                System.out.println("YES");
            }else{
                System.out.println("NO");
            }
            
            
        }
        }catch(Exception e){
            e.printStackTrace();
        }
        
    }
    
    public static List<Integer> getList(char[] c){
        
        List<Integer> list = new ArrayList<Integer>();
        int index=0;
        String used =""; //记录已经出现过的字母
        
        for(int i=0;i<c.length;i++){
            if((index=used.indexOf(c[i]))==-1){
                
                used+=c[i];
                list.add(1);
                
            }else{
                list.set(index, (Integer)list.get(index)+1);
            }
        }
        
        return list;
    }
}