import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.LinkedHashMap;
import java.util.List;
import java.util.Map;
import java.util.Set;
public class FirstNonRepeatedChar {
public static void main(String[] args) {
// TODO Auto-generated method stub
FirstNonRepeatedChar obj = new FirstNonRepeatedChar();
obj.findChar("MAXIMUM");
}
public void findChar(String str) {
char[] chArr = str.toCharArray();
Map<Character, Integer> map = new LinkedHashMap<Character, Integer>();
for (int i = 0; i < chArr.length; i++) {
if (map.get(Character.valueOf(chArr[i])) != null) {
map.put(Character.valueOf(chArr[i]), (map.get(Character.valueOf(chArr[i])) + 1));
} else {
map.put(Character.valueOf(chArr[i]), 1);
}
}
Iterator<Character> it = map.keySet().iterator();
while (it.hasNext()) {
Character ch = it.next();
if (map.get(ch) == 1) {
System.out.println(ch);
break;
}
}
}
}
Output:
A
No comments:
Post a Comment