-
Notifications
You must be signed in to change notification settings - Fork 79
/
MakingAnagrams.java
51 lines (39 loc) · 1.23 KB
/
MakingAnagrams.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
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;
public class Solution {
// Complete the makeAnagram function below.
static int makeAnagram(String a, String b) {
int hash[] = new int[27];
char c[] = a.toCharArray();
char d[] = b.toCharArray();
for(int i=0; i<c.length; i++ ){
hash[(int)c[i] - 97]++;
}
for(int i=0; i<d.length; i++ ){
hash[(int)d[i] - 97]--;
}
for(int i=0; i<26; i++ ){
if(hash[i]>0)
hash[26] += hash[i];
else
hash[26] -= hash[i];
}
return hash[26];
}
private static final Scanner scanner = new Scanner(System.in);
public static void main(String[] args) throws IOException {
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
String a = scanner.nextLine();
String b = scanner.nextLine();
int res = makeAnagram(a, b);
bufferedWriter.write(String.valueOf(res));
bufferedWriter.newLine();
bufferedWriter.close();
scanner.close();
}
}