package interview;
import java.util.*;
//Print first Non Repeated character
public class FirstNonRepeatedCharacter {
public static void main(String[] args)
{
String str = "computercomputes";
char[] ch = str.toCharArray();
LinkedHashMap<Character,Integer> link = new LinkedHashMap<>();
for(int i = 0;i<ch.length;i++)
{
if(link.containsKey(ch[i]))
{
link.put(ch[i], link.get(ch[i])+1);
}
else
{
link.put(ch[i],1);
}
}
//***Iterate
for(Map.Entry<Character,Integer> entry : link.entrySet())
{
if(entry.getValue()==1)
{
System.out.println("first NRC: "+entry.getKey());
System.out.println("first NRC: "+entry.getKey().toString().toUpperCase());
return;
}
}
}
}
import java.util.*;
//Print first Non Repeated character
public class FirstNonRepeatedCharacter {
public static void main(String[] args)
{
String str = "computercomputes";
char[] ch = str.toCharArray();
LinkedHashMap<Character,Integer> link = new LinkedHashMap<>();
for(int i = 0;i<ch.length;i++)
{
if(link.containsKey(ch[i]))
{
link.put(ch[i], link.get(ch[i])+1);
}
else
{
link.put(ch[i],1);
}
}
//***Iterate
for(Map.Entry<Character,Integer> entry : link.entrySet())
{
if(entry.getValue()==1)
{
System.out.println("first NRC: "+entry.getKey());
System.out.println("first NRC: "+entry.getKey().toString().toUpperCase());
return;
}
}
}
}
No comments:
Post a Comment