fork(1) download
  1. import java.util.HashMap;
  2. import java.util.Scanner;
  3.  
  4. /**
  5.  *
  6.  * @author Neelabh
  7.  */
  8. class FirstNonRepeatedCharacter {
  9. public static void main(String [] args){
  10. Scanner scan=new Scanner(System.in);
  11. String string=scan.next();
  12. int len=string.length();
  13. HashMap<Character, Integer> hashMap=new HashMap<Character, Integer>();
  14. //First Scan
  15. for(int i = 0; i <len;i++){
  16. char currentCharacter=string.charAt(i);
  17. if(!hashMap.containsKey(currentCharacter)){
  18. hashMap.put(currentCharacter, 1);
  19. }
  20. else{
  21. hashMap.put(currentCharacter, hashMap.get(currentCharacter)+1);
  22. }
  23. }
  24. // Second Scan
  25. boolean flag=false;
  26. char firstNonRepeatingChar = 0;
  27. for(int i=0;i<len;i++){
  28. char c=string.charAt(i);
  29. if(hashMap.get(c)==1){
  30. flag=true;
  31. firstNonRepeatingChar=c;
  32. break;
  33. }
  34. }
  35. if(flag==true)
  36. System.out.println("firstNonRepeatingChar is "+firstNonRepeatingChar);
  37. else
  38. System.out.println("There is no such type of character");
  39. }
  40. }
Success #stdin #stdout 0.1s 380736KB
stdin
geeksforgeeks
stdout
firstNonRepeatingChar is f