Home  >  Article  >  Backend Development  >  An arrangement of words that does not change the relative positions of vowels and consonants?

An arrangement of words that does not change the relative positions of vowels and consonants?

王林
王林forward
2023-09-01 13:01:061343browse

An arrangement of words that does not change the relative positions of vowels and consonants?

Suppose we have a string containing n elements (n

The method is very simple. We have to count the number of vowels and consonants in a given string, then we have to find how many ways only the vowels can be arranged, then find the number of ways only the consonants can be arranged, and then multiply these two results to get the total Number of ways.

Algorithm

arrangeWayCount(str)

Begin
   define an array ‘freq’ to store frequency.
   count and place frequency of each characters in freq array. such that freq[‘0’] will hold
   frequency of letter ‘a’, freq[1] will hold frequency of ‘b’ and so on.
   v := number of vowels, and c := number of consonants in str
   vArrange := factorial of v
   for each vowel v in [a, e, i, o, u], do
      vArrange := vArrange / factorial of the frequency of v
   done
   cArrange := factorial of c
   for each consonant con, do
      cArrange := cArrange / factorial of the frequency of con
   done
   return vArrange * cArrange
End

Example

#include <iostream>
using namespace std;
long long factorial(int n){
   if(n == 0 || n == 1)
      return 1;
   return n*factorial(n-1);
}
long long arrangeWayCount(string str){
   long long freq[27] = {0}; //fill frequency array to 0
   int v = 0, c = 0;
   for (int i = 0; i < str.length(); i++) {
      freq[str[i] - &#39;a&#39;]++;
      if (str[i] == &#39;a&#39; || str[i] == &#39;e&#39; || str[i] == &#39;i&#39; || str[i] == &#39;o&#39; || str[i] == &#39;u&#39;) {
         v++;
      }else
         c++;
   }
   long long arrangeVowel;
   arrangeVowel = factorial(v);
   arrangeVowel /= factorial(freq[0]); // vowel a
   arrangeVowel /= factorial(freq[4]); // vowel e
   arrangeVowel /= factorial(freq[8]); // vowel i
   arrangeVowel /= factorial(freq[14]); // vowel o
   arrangeVowel /= factorial(freq[20]); // vowel u
   long long arrangeConsonant;
   arrangeConsonant = factorial(c);
   for (int i = 0; i < 26; i++) {
      if (i != 0 && i != 4 && i != 8 && i != 14 && i != 20)
      arrangeConsonant /= factorial(freq[i]); //frequency of all characters except vowels
   }
   long long total = arrangeVowel * arrangeConsonant;
   return total;
}
main() {
   string str = "computer";
   long long ans = arrangeWayCount(str);
   cout << "Possible ways to arrange: " << ans << endl;
}

Output

Possible ways to arrange: 720

The above is the detailed content of An arrangement of words that does not change the relative positions of vowels and consonants?. For more information, please follow other related articles on the PHP Chinese website!

Statement:
This article is reproduced at:tutorialspoint.com. If there is any infringement, please contact admin@php.cn delete

Related articles

See more