-
Notifications
You must be signed in to change notification settings - Fork 0
/
Non Repeating Character.java
64 lines (53 loc) · 1.37 KB
/
Non Repeating Character.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
//{ Driver Code Starts
//Initial Template for Java
import java.io.*;
import java.lang.*;
import java.util.*;
class Driverclass
{
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
int t = sc.nextInt();
while(t-- > 0)
{
String st = sc.next();
char ans=new Solution().nonrepeatingCharacter(st);
if(ans!='$')
System.out.println(ans);
else
System.out.println(-1);
}
}
}
// } Driver Code Ends
//User function Template for Java
class Solution
{
//Function to find the first non-repeating character in a string.
static char nonrepeatingCharacter(String S)
{
//Your code here
LinkedHashMap<Character,Integer> lmap=new LinkedHashMap<>();
for(int i=0;i<S.length();i++)
{
char c=S.charAt(i);
if((lmap.get(c))==null)
lmap.put(c,0);
if((lmap.get(c))>=1)
{
lmap.put(S.charAt(i),lmap.get(c)+1);
}
else
{
lmap.put(S.charAt(i),1);
}
}
for(Map.Entry<Character,Integer> i:lmap.entrySet())
{
if(i.getValue()==1)
return i.getKey();
}
return '$';
}
}