第一个只出现一次的字符

import com.sun.xml.internal.fastinfoset.util.CharArray;

import java.util.HashMap;
import java.util.Map;

public class FindFirstChar {
    public  int findFirstChar1(String s){
        if (s==null) return -1;
        Map< Character ,Integer> map= new HashMap<Character ,Integer>();
        char[] ch = s.toCharArray();
        int[] record = new int[256];
        for(int i = 0; i < ch.length; ++i){
            record[ch[i]]++;
        }
        for(int i=0;i<ch.length;i++) {
            if(record[ch[i]]==1) {
                return i;
            }
        }
        return 0;
    }

    public  int findFirstChar2(String str){
        if(str.length()<=0||str==null) {
            return -1;
        }
        Map<Character,Integer> record = new HashMap<Character,Integer>();
        char[] ch = str.toCharArray();

        for(int i=0;i<ch.length;i++) {
            if(!record.containsKey(ch[i])) {
                record.put(ch[i], 1);
            }else {
                record.put(ch[i], record.get(ch[i])+1);
            }
        }

        for(int i=0;i<ch.length;i++) {
            if(record.get(ch[i])==1) {
                return i;
            }
        }

        return 0;
    }
}