在与英语字母表相同的位置计算字符数-yiteyi-C++库

给定一组大写和小写字符，任务是找出有多少字符与英语字母表中的相同位置。 例如：

null

Input:  ABcED Output :  3First three characters are at same positionas in English alphabets.Input:  geeksforgeeks Output :  1Only 'f' is at same position as in EnglishalphabetInput :  alphabetical Output :  3

推荐：请尝试你的方法 {IDE} 首先，在进入解决方案之前。

为此，我们可以采用简单的方法：

1) Initialize result as 0.2) Traverse input string and do following for every    character str[i]     a) If 'i' is same as str[i] - 'a' or same as         str[i] - 'A', then do result++3) Return result

C++

                         // C++ program to find number of characters at same                       
                         // position as in English alphabets                       
                         #include<bits/stdc++.h>                       
                         using                                     namespace                                     std;                       
           
                         int                                     findCount(string str)                       
                         {                       
                                                 int                                     result = 0;                       
           
                                                 // Traverse input string                       
                                                 for                                     (                                     int                                     i = 0 ; i < str.size(); i++)                       
           
                                                 // Check that index of characters of string is                       
                                                 // same as of English alphabets by using ASCII                       
                                                 // values and the fact that all lower case                       
                                                 // alphabetic characters come together in same                       
                                                 // order in ASCII table.  And same is true for                       
                                                 // upper case.                       
                                                 if                                     (i == (str[i] -                                     'a'                                     ) || i == (str[i] -                                     'A'                                     ))                       
                                                 result++;                       
           
           
                                                 return                                     result;                       
                         }                       
           
                         // Driver code                       
                         int                                     main()                       
                         {                       
                                                 string str =                                     "AbgdeF"                                     ;                       
                                                 cout << findCount(str);                       
                                                 return                                     0;                       
                         }                       

JAVA

                         // Java program to find number of                       
                         // characters at same position                       
                         // as in English alphabets                       
                         class                                     GFG                       
                         {                       
           
                                                 static                                     int                                     findCount(String str)                       
                                                 {                       
                                                 int                                     result =                                     0                                     ;                       
           
                                                 // Traverse input string                       
                                                 for                                     (                                     int                                     i =                                     0                                     ; i < str.length(); i++)                       
                                   
                                                 // Check that index of characters                       
                                                 // of string is same as of English                       
                                                 // alphabets by using ASCII values                       
                                                 // and the fact that all lower case                       
                                                 // alphabetic characters come together                       
                                                 // in same order in ASCII table. And                       
                                                 // same is true for upper case.                       
                                                 {                       
                                                 if                                     (i == (str.charAt(i) -                                     'a'                                     )                       
                                                 || i == (str.charAt(i) -                                     'A'                                     ))                       
                                                 {                       
                                                 result++;                       
                                                 }                       
                                                 }                       
                                                 return                                     result;                       
                                                 }                       
           
                                                 // Driver code                       
                                                 public                                     static                                     void                                     main(String[] args)                       
                                                 {                       
                                                 String str =                                     "AbgdeF"                                     ;                       
                                                 System.out.print(findCount(str));                       
                                                 }                       
                         }                       
           
                         // This code is contributed by Rajput-JI                       

Python3

                         # Python program to find number of                       
                         # characters at same position as                       
                         # in English alphabets                       
           
                         # Function to count the number of                       
                         # characters at same position as                       
                         # in English alphabets                       
                         def                                     findCount(                                     str                                     ):                       
                                                 result                                     =                                     0                       
           
                                                 # Traverse the input string                       
                                                 for                                     i                                     in                                     range                                     (                                     len                                     (                                     str                                     )):                       
           
                                                 # Check that index of characters of string is                       
                                                 # same as of English alphabets by using ASCII                       
                                                 # values and the fact that all lower case                       
                                                 # alphabetic characters come together in same                       
                                                 # order in ASCII table. And same is true for                       
                                                 # upper case.                       
                                                 if                                     ((i                                     =                                     =                                     ord                                     (                                     str                                     [i])                                     -                                     ord                                     (                                     'a'                                     ))                                     or                       
                                                 (i                                     =                                     =                                     ord                                     (                                     str                                     [i])                                     -                                     ord                                     (                                     'A'                                     ))):                       
                                                 result                                     +                                     =                                     1                       
                                                 return                                     result                       
           
                         # Driver Code                       
                         str                                     =                                     'AbgdeF'                       
                         print                                     (findCount(                                     str                                     ))                       
           
                         # This code is contributed                       
                         # by SamyuktaSHegde                       

C#

                         // C# program to find number of                       
                         // characters at same position                       
                         // as in English alphabets                       
                         using                                     System;                       
           
                         class                                     GFG                       
                         {                       
                         static                                     int                                     findCount(                                     string                                     str)                       
                         {                       
                                                 int                                     result = 0;                       
           
                                                 // Traverse input string                       
                                                 for                                     (                                     int                                     i = 0 ; i < str.Length; i++)                       
           
                                                 // Check that index of characters                       
                                                 // of string is same as of English                       
                                                 // alphabets by using ASCII values                       
                                                 // and the fact that all lower case                       
                                                 // alphabetic characters come together                       
                                                 // in same order in ASCII table. And                       
                                                 // same is true for upper case.                       
                                                 if                                     (i == (str[i] -                                     'a'                                     ) ||                       
                                                 i == (str[i] -                                     'A'                                     ))                       
                                                 result++;                       
           
                                                 return                                     result;                       
                         }                       
           
                         // Driver code                       
                         public                                     static                                     void                                     Main()                       
                         {                       
                                                 string                                     str =                                     "AbgdeF"                                     ;                       
                                                 Console.Write(findCount(str));                       
                         }                       
                         }                       
           
                         // This code is contributed                       
                         // by Akanksha Rai                       

PHP

                         <?php                       
                         // PHP program to find number of                       
                         // characters at same position as                       
                         // in English alphabets                       
           
                         // Function to count the number of                       
                         // characters at same position as                       
                         // in English alphabets                       
                         function                                     findCount(                                     $str                                     )                       
                         {                       
                                                 $result                                     = 0;                       
           
                                                 // Traverse the input string                       
                                                 for                                     (                                     $i                                     = 0;                                     $i                                     <                                     strlen                                     (                                     $str                                     );                                     $i                                     ++)                       
                                                 {                       
           
                                                 // Check that index of characters of string is                       
                                                 // same as of English alphabets by using ASCII                       
                                                 // values and the fact that all lower case                       
                                                 // alphabetic characters come together in same                       
                                                 // order in ASCII table. And same is true for                       
                                                 // upper case.                       
                                                 if                                     ((                                     $i                                     == ord(                                     $str                                     [                                     $i                                     ]) - ord(                                     'a'                                     ))                                     or                       
                                                 (                                     $i                                     == ord(                                     $str                                     [                                     $i                                     ]) - ord(                                     'A'                                     )))                       
                                                 $result                                     += 1;                       
                                                 }                       
                                                 return                                     $result                                     ;                       
                         }                       
           
                         // Driver Code                       
                         $str                                     =                                     "AbgdeF"                                     ;                       
                         print                                     (findCount(                                     $str                                     ))                       
           
                         // This code has been contributed by 29AjayKumar                       
                         ?>                       

Javascript

                         <script>                       
                                                 // JavaScript program to find number of characters at same                       
                                                 // position as in English alphabets                       
           
                                                 function                                     findCount(str) {                       
                                                 var                                     result = 0;                       
           
                                                 // Traverse input string                       
                                                 for                                     (                                     var                                     i = 0; i < str.length; i++)                       
                                                 // Check that index of characters of string is                       
                                                 // same as of English alphabets by using ASCII                       
                                                 // values and the fact that all lower case                       
                                                 // alphabetic characters come together in same                       
                                                 // order in ASCII table. And same is true for                       
                                                 // upper case.                       
                                                 if                                     (                       
                                                 i === str[i].charCodeAt(0) -                                     "a"                                     .charCodeAt(0) ||                       
                                                 i === str[i].charCodeAt(0) -                                     "A"                                     .charCodeAt(0)                       
                                                 )                       
                                                 result++;                       
           
                                                 return                                     result;                       
                                                 }                       
           
                                                 // Driver code                       
                                                 var                                     str =                                     "AbgdeF"                                     ;                       
                                                 document.write(findCount(str));                       
                                                 </script>                       

输出：

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

文章版权归作者所有，未经允许请勿转载。

THE END

技术文章