计算字符串中元音的程序(迭代和递归)

给定一个字符串,计算其中元音(a、e、i、o、u)的总数。有两种方法可以计算字符串中元音的总数。 1.迭代 2.递归 例如:

null
Input : abc deOutput : 2Input : geeksforgeeks portalOutput : 7

1.迭代法 以下是实施情况:

C++

// C++ program to count vowels in a string
#include<iostream>
using namespace std;
// Function to check the Vowel
bool isVowel( char ch)
{
ch = toupper (ch);
return (ch== 'A' || ch== 'E' || ch== 'I' ||
ch== 'O' || ch== 'U' );
}
// Returns count of vowels in str
int countVowels(string str)
{
int count = 0;
for ( int i=0; i<str.length(); i++)
if (isVowel(str[i])) // Check for vowel
++count;
return count;
}
// Main Calling Function
int main()
{
//string object
string str = "abc de" ;
// Total numbers of Vowel
cout << countVowels(str) << endl;
return 0;
}


JAVA

// Java program to count vowels in a string
public class GFG {
// Function to check the Vowel
static boolean isVowel( char ch)
{
ch = Character.toUpperCase(ch);
return (ch== 'A' || ch== 'E' || ch== 'I' ||
ch== 'O' || ch== 'U' );
}
// Returns count of vowels in str
static int countVowels(String str)
{
int count = 0 ;
for ( int i = 0 ; i < str.length(); i++)
if (isVowel(str.charAt(i))) // Check for vowel
++count;
return count;
}
// Driver code
public static void main(String args[])
{
//string object
String str = "abc de" ;
// Total numbers of Vowel
System.out.println(countVowels(str));
}
}
// This code is contributed by Sumit Ghosh


Python3

# Python3 program to count vowels
# in a string
# Function to check the Vowel
def isVowel(ch):
return ch.upper() in [ 'A' , 'E' , 'I' , 'O' , 'U' ]
# Returns count of vowels in str
def countVowels( str ):
count = 0
for i in range ( len ( str )):
# Check for vowel
if isVowel( str [i]):
count + = 1
return count
# Driver Code
# string object
str = 'abc de'
# Total number of Vowels
print (countVowels( str ))
# This code is contributed
# by SamyuktaSHegde


C#

// C# program to count vowels in a string
using System;
class GFG
{
// Function to check the Vowel
public static bool isVowel( char ch)
{
ch = char .ToUpper(ch);
return (ch == 'A' || ch == 'E' ||
ch == 'I' || ch == 'O' ||
ch == 'U' );
}
// Returns count of vowels in str
public static int countVowels( string str)
{
int count = 0;
for ( int i = 0; i < str.Length; i++)
{
// Check for vowel
if (isVowel(str[i]))
{
++count;
}
}
return count;
}
// Driver code
public static void Main( string [] args)
{
//string object
string str = "abc de" ;
// Total numbers of Vowel
Console.WriteLine(countVowels(str));
}
}
// This code is contributed by Shrikant13


PHP

<?php
// PHP program to count vowels in a string
// Function to check the Vowel
function isVowel( $ch )
{
$ch = strtoupper ( $ch );
return ( $ch == 'A' || $ch == 'E' ||
$ch == 'I' || $ch == 'O' ||
$ch == 'U' );
}
// Returns count of vowels in str
function countVowels( $str )
{
$count = 0;
for ( $i = 0; $i < strlen ( $str ); $i ++)
if (isVowel( $str [ $i ])) // Check for vowel
++ $count ;
return $count ;
}
// Driver Code
//string object
$str = "abc de" ;
// Total numbers of Vowel
echo countVowels( $str ) . "" ;
// This code is contributed
// by Akanksha Rai
?>


Javascript

<script>
// JavaScript program to count vowels in a string
// Function to check the Vowel
function isVowel(ch) {
ch = ch.toUpperCase();
return ch == "A" || ch == "E" || ch == "I" || ch == "O" || ch == "U" ;
}
// Returns count of vowels in str
function countVowels(str)
{
var count = 0;
for ( var i = 0; i < str.length; i++)
if (isVowel(str[i]))
// Check for vowel
++count;
return count;
}
// Main Calling Function
// string object
var str = "abc de" ;
// Total numbers of Vowel
document.write(countVowels(str));
document.write( "<br>" );
// This code is contributed by rdtank.
</script>


输出:

2

2.递归法 以下是实施情况:

C++

// Recursive C++ program to count the total
// number of vowels using recursion
#include<iostream>
using namespace std;
// Function to check the Vowel
bool isVowel( char ch)
{
ch = toupper (ch);
return (ch== 'A' || ch== 'E' || ch== 'I' ||
ch== 'O' || ch== 'U' );
}
// to count total number of vowel from 0 to n
int countVovels(string str, int n)
{
if (n == 1)
return isVowel(str[n-1]);
return countVovels(str, n-1) + isVowel(str[n-1]);
}
// Main Calling Function
int main()
{
// string object
string str = "abc de" ;
// Total numbers of Vowel
cout << countVovels(str, str.length()) << endl;
return 0;
}


JAVA

// Recursive Java program to count the total
// number of vowels using recursion
public class GFG {
// Function to check the Vowel
static int isVowel( char ch)
{
ch = Character.toUpperCase(ch);
if (ch== 'A' || ch== 'E' || ch== 'I' ||
ch== 'O' || ch== 'U' )
return 1 ;
else return 0 ;
}
// to count total number of vowel from 0 to n
static int countVowels(String str, int n)
{
if (n == 1 )
return isVowel(str.charAt(n - 1 ));
return countVowels(str, n- 1 ) + isVowel(str.charAt(n - 1 ));
}
// Main Calling Function
public static void main(String args[])
{
//string object
String str = "abc de" ;
// Total numbers of Vowel
System.out.println(countVowels(str,str.length()));
}
}
// This code is contributed by Sumit Ghosh


Python 3

# Recursive Python 3 program to count the
# total number of vowels using recursion
# Function to check the Vowel
def isVowel(ch):
return ch.upper() in [ 'A' , 'E' , 'I' , 'O' , 'U' ]
# to count total number of
# vowel from 0 to n
def countVovels( str , n):
if (n = = 1 ):
return isVowel( str [n - 1 ]);
return (countVovels( str , n - 1 ) +
isVowel( str [n - 1 ]));
# Driver Code
# string object
str = "abc de" ;
# Total numbers of Vowel
print (countVovels( str , len ( str )))
# This code is contributed
# by Akanksha Rai


C#

using System;
// Recursive C# program to count the total
// number of vowels using recursion
public class GFG
{
// Function to check the Vowel
public static int isVowel( char ch)
{
ch = char .ToUpper(ch);
if (ch == 'A' || ch == 'E' || ch == 'I' || ch == 'O' || ch == 'U' )
{
return 1;
}
else
{
return 0;
}
}
// to count total number of vowel from 0 to n
public static int countVowels( string str, int n)
{
if (n == 1)
{
return isVowel(str[n - 1]);
}
return countVowels(str, n - 1) + isVowel(str[n - 1]);
}
// Main Calling Function
public static void Main( string [] args)
{
//string object
string str = "abc de" ;
// Total numbers of Vowel
Console.WriteLine(countVowels(str,str.Length));
}
}
// This code is contributed by Shrikant13


PHP

<?php
// Recursive PHP program to count the total
// number of vowels using recursion
// Function to check the Vowel
function isVowel( $ch )
{
$ch = strtoupper ( $ch );
return ( $ch == 'A' || $ch == 'E' ||
$ch == 'I' || $ch == 'O' ||
$ch == 'U' );
}
// to count total number of
// vowel from 0 to n
function countVovels( $str , $n )
{
if ( $n == 1)
return isVowel( $str [ $n - 1]);
return countVovels( $str , $n - 1) +
isVowel( $str [ $n - 1]);
}
// Driver Code
// string object
$str = "abc de" ;
// Total numbers of Vowel
echo countVovels( $str , strlen ( $str )) . "" ;
// This code is contributed
// by Akanksha Rai
?>


输出:

2

递归代码是如何工作的。。

图片[1]-计算字符串中元音的程序(迭代和递归)-yiteyi-C++库

本文由 普拉哈尔·阿格拉瓦尔 .如果你喜欢GeekSforgek,并想贡献自己的力量,你也可以使用 写极客。组织 或者把你的文章寄去评论-team@geeksforgeeks.org.看到你的文章出现在Geeksforgeks主页上,并帮助其他极客。 如果您发现任何不正确的地方,或者您想分享有关上述主题的更多信息,请写下评论。

© 版权声明
THE END
喜欢就支持一下吧
点赞7 分享