-
Notifications
You must be signed in to change notification settings - Fork 101
/
Copy pathAnagramDifference.java
50 lines (44 loc) · 1.2 KB
/
AnagramDifference.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
/**
*
*/
package com.javaaid.ip.app_dynamics;
import java.util.Scanner;
/**
* @author Kanahaiya Gupta
*
*/
public class AnagramDifference {
public static void main(String[] args) {
AnagramDifference s=new AnagramDifference();
Scanner in = new Scanner(System.in);
String[] a = {"a","jk","abb","mn","abc"} ;
String[] b = {"bb","kj","bbc","op","def"};
s.getMinimumDifference(a,b);
}
private int[] getMinimumDifference(String[] a, String[] b) {
int n=a.length;
int ans[]=new int[n];
for(int i=0;i<n;i++) {
String s1=a[i];
String s2=b[i];
int result=getAnagramDiff(s1,s2);
ans[i]=result;
// System.out.println(result);
}
return ans;
}
int getAnagramDiff(String s1, String s2)
{
int count = 0;
int s1len=s1.length();
int s2len=s2.length();
if(s1len!=s2len)return-1;
int char_count[] = new int[26];
for (int i = 0; i < s1.length(); i++)
char_count[s1.charAt(i) - 'a']++;
for (int i = 0; i < s2.length(); i++)
if (char_count[s2.charAt(i) - 'a']-- <= 0)
count++;
return count;
}
}