Programa para contar la aparición de un carácter dado en una string

Dada una string y un carácter, la tarea es hacer una función que cuente la ocurrencia del carácter dado en la string.

Ejemplos:  

Input : str = "geeksforgeeks"
         c = 'e'
Output : 4
'e' appears four times in str.

Input : str = "abccdefgaa"
          c = 'a' 
Output : 3
'a' appears three times in str.

Implementación:

// C++ program to count occurrences of a given
// character
#include <iostream>
#include <string>
using namespace std;
 
// Function that return count of the given
// character in the string
int count(string s, char c)
{
    // Count variable
    int res = 0;
 
    for (int i=0;i<s.length();i++)
 
        // checking character in string
        if (s[i] == c)
            res++;
 
    return res;
}
 
// Driver code
int main()
{
    string str= "geeksforgeeks";
    char c = 'e';
    cout << count(str, c) << endl;
    return 0;
}

// JAVA program to count occurrences
// of a character
 
class GFG
{
    // Method that return count of the given
    // character in the string
    public static int count(String s, char c)
    {
        int res = 0;
 
        for (int i=0; i<s.length(); i++)
        {
            // checking character in string
            if (s.charAt(i) == c)
            res++;
        }
        return res;
    }
     
    // Driver method
    public static void main(String args[])
    {
        String str= "geeksforgeeks";
        char c = 'e';
        System.out.println(count(str, c));
    }
}

# Python program to count occurrences
# of a given character
 
# Method that return count of the
# given character in the string
def count(s, c) :
     
    # Count variable
    res = 0
     
    for i in range(len(s)) :
         
        # Checking character in string
        if (s[i] == c):
            res = res + 1
    return res
     
     
# Driver code
str= "geeksforgeeks"
c = 'e'
print(count(str, c))
     
# This code is contributed by "rishabh_jain".

// C# program to count occurrences
// of a character
using System;
         
public class GFG {
     
    // Method that return count of the given
    // character in the string
    public static int count(string s, char c)
    {
        int res = 0;
 
        for (int i = 0; i < s.Length; i++)
        {
             
            // checking character in string
            if (s[i] == c)
            res++;
        }
         
        return res;
    }
     
    // Driver method
    public static void Main()
    {
        string str = "geeksforgeeks";
        char c = 'e';
         
        Console.WriteLine(count(str, c));
    }
}
 
// This code is contributed by Sam007.

<?php
// PHP program to count
// occurrences of a given
// character
 
// Function that return count of
// the given character in the string
function count($s, $c)
{
     
    // Count variable
    $res = 0;
 
    for ($i = 0; $i < strlen($s); $i++)
 
        // checking character in string
        if ($s[$i] == $c)
            $res++;
 
    return $res;
}
 
    // Driver Code
    $str= "geeksforgeeks";
    $c = 'e';
    echo count($str, $c) ;
    return 0;
     
// This code is contributed by nitin mittal.
?>

<script>
// JAVASCRIPT program to count occurrences
// of a character
    // Method that return count of the given
    // character in the string
    function count(s, c)
    {
        let res = 0;
 
        for (let i = 0; i < s.length; i++)
        {
            // checking character in string
            if (s.charAt(i) == c)
            res++;
        }
        return res;
    }
     
    // Driver method  
        let str= "geeksforgeeks";
        let c = 'e';
        document.write(count(str, c));
         
 // This code is contributed by shivanisinghss2110      
 </script>

4

Complejidad de tiempo: O(len) , donde len es el tamaño de la string dada.
Espacio Auxiliar: O(1)

Implementación usando Direct Function en C++:

// CPP program to count occurrences of
// a character using library
#include<bits/stdc++.h>
using namespace std;
 
// Driver code
int main()
{
    string str = "geeksforgeeks";
    char c = 'e';
   
    // Count returns number of occurrences of
    // c between two given positions provided
    // as two iterators.
    cout << count(str.begin(), str.end(), c);
    return 0;
}

4

Complejidad de tiempo: O(len), donde len es el tamaño de la string dada.
Espacio Auxiliar: O(1) 

Implementación usando recursividad:

#include<bits/stdc++.h>
using namespace std;
 
int countinString(char ch,string s)
{
    // base case;
    if (s.length() == 0)
        return 0;
        int count = 0;
 
    // checking if the first character of
    // the given string is that character
    // or not
    if (s[0] == ch)
        count++;
 
        // this will count the occurrence of
        // given character in the string
        // from index 1 to the last
        // index of the string
    count += countinString(ch, s.substr(1));
 
    return count;
}
 
int main(){
    string str = "geeksforgeeks";
    char c = 'e';
    cout<<(countinString(c, str));
}
 
// This code is contributed by shinjanpatra

/*package whatever //do not write package name here */
 
import java.io.*;
 
class GFG {
      static int countinString(char ch, String s)
    {
          //base case;
        if(s.length()==0)
            return 0;
          int count = 0;
       
          //checking if the first character of
          //the given string is that character
          //or not
          if(s.charAt(0)==ch)
          count++;
       
          //this will count the occurrence of
          //given character in the string
          //from index 1 to the last
          //index of the string
          count+=countinString(ch,s.substring(1));
       
           
        return count;
    }
    public static void main (String[] args) {
        String str= "geeksforgeeks";
        char c = 'e';
        System.out.println(countinString(c,str));
    }
}

def countinString(ch, s):
 
    # base case;
    if (len(s) == 0):
        return 0
    count = 0
 
    # checking if the first character of
    # the given string is that character
    # or not
    if (s[0] == ch):
        count += 1
 
    # this will count the occurrence of
    # given character in the string
    # from index 1 to the last
    # index of the string
    count += countinString(ch, s[1:])
 
    return count
     
str = "geeksforgeeks"
c = 'e'
print(countinString(c, str))
 
# This code is contributed by shinjanpatra

/*package whatever //do not write package name here */
using System;
public class GFG {
      static int countinString(char ch, String s)
    {
          // base case;
        if(s.Length == 0)
            return 0;
          int count = 0;
       
          // checking if the first character of
          // the given string is that character
          // or not
          if(s[0] == ch)
          count++;
       
          // this will count the occurrence of
          // given character in the string
          // from index 1 to the last
          // index of the string
          count += countinString(ch,s.Substring(1));
       
           
        return count;
    }
   
  // Driver code
    public static void Main(String[] args) {
        String str= "geeksforgeeks";
        char c = 'e';
        Console.WriteLine(countinString(c,str));
    }
}
 
// This code is contributed by umadevi9616

<script>
/*package whatever //do not write package name here */
 
    function countinString( ch, s)
    {
        // base case;
        if (s.length == 0)
            return 0;
        var count = 0;
 
        // checking if the first character of
        // the given string is that character
        // or not
        if (s[0] == ch)
            count++;
 
        // this will count the occurrence of
        // given character in the string
        // from index 1 to the last
        // index of the string
        count += countinString(ch, s.substring(1));
 
        return count;
    }
     
        var str = "geeksforgeeks";
        var c = 'e';
        document.write(countinString(c, str));
 
// This code is contributed by gauravrajput1
</script>

4

Complejidad de tiempo: O(len) , donde len es el tamaño de la string dada.

Espacio auxiliar: O(len), donde len es el tamaño de la string dada.

Este artículo es una contribución de Sahil Rajput . Si le gusta GeeksforGeeks y le gustaría contribuir, también puede escribir un artículo usando contribuya.geeksforgeeks.org o envíe su artículo por correo a review-team@geeksforgeeks.org. Vea su artículo que aparece en la página principal de GeeksforGeeks y ayude a otros Geeks.