Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.HashMap;
- import java.util.Scanner;
- public class FindFirstNonRepeatingChar {
- public static void main(String[] args) {
- Scanner s=new Scanner(System.in);
- HashMap<Character,Integer> m=new HashMap<Character, Integer>();
- String str=s.next();
- for(int i=0;i<str.length();i++){
- if(!m.containsKey(str.charAt(i))){
- m.put(str.charAt(i),1);
- }
- else{
- m.put(str.charAt(i),m.get(str.charAt(i))+1);
- }
- }
- boolean flag=false;
- char ans =' ';
- for(int i=0;i<str.length();i++){
- if(m.get(str.charAt(i))==1){
- flag =true;
- ans=str.charAt(i);
- break;
- }
- }
- if(flag){
- System.out.println((char)ans);
- }
- else{
- System.out.println("No non-repeating character");
- }
- }
- }
Add Comment
Please, Sign In to add comment