JavaCodeSolutions/ninteen.java at master · rahulgupta1999/JavaCodeSolutions · GitHub

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
import java.util.Scanner;

public class Solution {

    static boolean isAnagram(String a, String b) {
        char A[]=a.toCharArray();
        int k,l,p=0,q=0;
        if(a.length()!=b.length())
        {
            return false;
        }
        else
        {
for(int i=0; i<A.length; i++)
        {
            if(b.toLowerCase().contains(Character.toString(A[i]).toLowerCase()))
            {
                for(k=0;k<A.length; k++)
                {
                    if(Character.toString(A[i]).equalsIgnoreCase(Character.toString(A[k])))
                    {
                        p++;
                    }
                }
                p=p-1;
               char B[]=b.toCharArray();
               for(int c=0; c<B.length; c++)
               {

                    if(Character.toString(A[i]).equalsIgnoreCase((Character.toString(B[c]))))
                    {
                        q++;
                    }
               }
               q=q-1;
              if(q==p)
              {
                        return true;
              } else
              {
                      return false;
              }
            }else
              {
                 return false;
              }
        }
        }
        return false;
    }

    public static void main(String[] args) {

        Scanner scan = new Scanner(System.in);
        String a = scan.next();
        String b = scan.next();
        scan.close();
        boolean ret = isAnagram(a, b);
        System.out.println( (ret) ? "Anagrams" : "Not Anagrams" );
    }
}