第一个只出现一次的字符

package 数组;

import java.util.HashMap;

public class FirstAppearOnce {
public static void main(String[] args) {
String s="abaccdebff";
char[]c=s.toCharArray();
HashMap<Character,Integer> map=new HashMap<Character,Integer>();
for(char s1:c){
if(!map.containsKey(s1)){
map.put(s1, 1);
}else{
map.put(s1, map.get(s1)+1);
}
}
for(char s2:map.keySet()){
int value=map.get(s2);
System.out.println(s2+""+value);
}
for(char ss:map.keySet()){
if(map.get(ss)==1){
System.out.println(ss);
break;
}
}
}

}