Question

WRITTEN IN JAVA Write a function as follows:

Receive a string as a parameter.Count the length of the string.Count the occurrences of each distinguishable symbol in the string (use an array).Divide the factorial of the length by the product of the factorials of the occurrences.Return the quotient as the integer result.The point of this function is to find the result only by using the formulas for permutations.For example, BAAA the function counts that the string length is 4, that A occurs 3times, and that B occurs 1time, then divides 4!by 3!and 1!and returns the quotient, which is 4.

Answer 1

JAVA CODE: Main.java

import java.util.*;
public class Main
{
static int totalPermutations(String str)
{
int n=str.length();
int arr[]=new int[26];
for(int i=0;i<n;i++)
{
if(Character.isLowerCase(str.charAt(i)))
arr[str.charAt(i)-'a']++;
else if(Character.isUpperCase(str.charAt(i)))
arr[str.charAt(i)-'A']++;
}
int p=fact(n);
for(int i=0;i<26;i++)
p/=fact(arr[i]);
return p;
}
static int fact(int n)
{
if(n==1||n==0)
return 1;
return n*fact(n-1);
}
   public static void main(String[] args) {
       System.out.println("Total Permutations of string BAAA = "+totalPermutations("BAAA"));
       System.out.println("Total Permutations of string CACB = "+totalPermutations("CACB"));
       System.out.println("Total Permutations of string abcccc = "+totalPermutations("abcccc"));
   }
}

Output:

Total Permutations of string BAAA = 4 Total Permutations of string CACB = 12 Total Permutations of string abcccc = 30 Program finished with exit code 0