Dada una string str. La tarea es encontrar el producto de los valores ASCII de los caracteres en la string.
Ejemplos :
Input : str = "IS" Output : 6059 73 * 83 = 6059 Input : str = "GfG" Output : 514182
La idea es comenzar con la iteración a través de los caracteres de la string y multiplicar sus valores ASCII a una variable, a saber, prod. Por lo tanto, devuelva prod después de la iteración completa de la string.
Nota : si la string es grande, el programa puede causar una falla de segmentación debido al tamaño limitado de un int.
A continuación se muestra la implementación del enfoque anterior:
C++
// C++ program to find product // of ASCII value of characters // in string #include <bits/stdc++.h> using namespace std; // Function to find product // of ASCII value of characters // in string long long productAscii(string str) { long long prod = 1; // Traverse string to find the product for (int i = 0; i < str.length(); i++) { prod *= (int)str[i]; } // Return the product return prod; } // Driver code int main() { string str = "GfG"; cout << productAscii(str); return 0; }
Java
// Java program to find product // of ASCII value of characters // in string class GFG { // Function to find product // of ASCII value of characters // in string static long productAscii(String str) { long prod = 1; // Traverse string to find the product for (int i = 0; i < str.length(); i++) { prod *= str.charAt(i); } // Return the product return prod; } // Driver Code public static void main(String[] args) { String str = "GfG"; System.out.println(productAscii(str)); } } // This code is contributed by Bilal
Python3
# Python3 program to find product # of ASCII value of characters # in string # Function to find product # of ASCII value of characters # in string def productAscii(str): prod = 1 # Traverse string to find the product for i in range(0, len(str)): prod = prod * ord(str[i]) # Return the product return prod # Driver code if __name__=='__main__': str = "GfG" print(productAscii(str)) # This code is contributed by # Sanjit_Prasad
C#
// C# program to find product // of ASCII value of characters // in string using System; class GFG { // Function to find product // of ASCII value of characters // in string static long productAscii(String str) { long prod = 1; // Traverse string to find the product for (int i = 0; i < str.Length; i++) { prod *= str[i]; } // Return the product return prod; } // Driver Code static public void Main () { String str = "GfG"; Console.Write(productAscii(str)); } } // This code is contributed by Raj
PHP
<?php // PHP program to find product // of ASCII value of characters // in string // Function to find product // of ASCII value of characters // in string function productAscii($str) { $prod = 1; // Traverse string to find the product for ($i = 0; $i < strlen($str); $i++) { $prod *= ord($str[$i]); } // Return the product return $prod; } // Driver code $str = "GfG"; echo productAscii($str); // This code is contributed // by ChitraNayal ?>
Javascript
<script> // javascript program to find product // of ASCII value of characters // in string // Function to find product // of ASCII value of characters // in string function productAscii(str) { var prod = 1; // Traverse string to find the product for (i = 0; i < str.length; i++) { prod *= str.charAt(i).charCodeAt(0); } // Return the product return prod; } // Driver Code str = "GfG"; document.write(productAscii(str)); // This code contributed by shikhasingrajput </script>
Producción:
514182
Complejidad de tiempo: O(N), donde N es la longitud de la string.