fork download
copy 
  1. import java.util.HashMap;
  2. import java.util.Scanner;
  3.  
  4.  
  5. class FirstNonRepeated {
  6.  
  7.     public static void main(String[] args)
  8.     {
  9.         String s= "stress";
  10.         char c=firstNonRepeatedCharacter(s);
  11.         System.out.println("The first non repeated character is :  " + c);
  12.     }
  13.  
  14.     public static Character firstNonRepeatedCharacter(String str)
  15.     {
  16.         HashMap<Character,Integer>  characterhashtable= 
  17.                      new HashMap<Character ,Integer>();
  18.         int i,length ;
  19.         Character c ;
  20.         length= str.length();  // Scan string and build hash table
  21.         for (i=0;i < length;i++)
  22.         {
  23.             c=str.charAt(i);
  24.             if(characterhashtable.containsKey(c))
  25.             {
  26.                 // increment count corresponding to c
  27.                 characterhashtable.put(  c ,  characterhashtable.get(c) +1 );
  28.             }
  29.             else
  30.             {
  31.                 characterhashtable.put( c , 1 ) ;
  32.             }
  33.         }
  34.         // Search characterhashtable in in order of string str
  35.  
  36.         for (i =0 ; i < length ; i++ )
  37.         {
  38.             c= str.charAt(i);
  39.             if( characterhashtable.get(c)  == 1 )
  40.             return c;
  41.         }
  42.         return null ;
  43.     }
  44. }
Success #stdin #stdout 0.04s 711168KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
The first non repeated character is :  t
https://ideone.com/CWZM5p
language:
Java (HotSpot 12)
created:
7 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!