Count character occurrences in a string in C

Question

How can I count the number of     in a string like  bla bla blabla bla

User · Answer

include  lt boost range algorithm count hpp gt   std  string str    a b c   int cnt   boost  count str

User · Answer

Using the lambda function to check the character is  quot   quot  then only count will be incremented else not a valid character std  string s    quot a b c quot   size t count   std  count if  s begin    s end        char c   if c        return true      std  cout  lt  lt   quot The count of numbers   quot   lt  lt  count  lt  lt  std  endl

User · Answer

Count character occurrences in a string is easy    include  lt bits stdc   h gt  using namespace std  int main         string s  Sakib Hossain       int cou count s begin   s end    a        cout lt  lt cou

User · Answer

Pseudocode   count   0 For each character c in string s   Check if c equals         If yes  increase count   EDIT  C   example code   int count underscores string s      int count   0     for  int i   0  i  lt  s size    i        if  s i          count       return count      Note that this is code to use together with std  string  if you re using char   replace s size   with strlen s    Also note  I can understand you want something  as small as possible   but I d suggest you to use this solution instead  As you see you can use a function to encapsulate the code for you so you won t have to write out the for loop everytime  but can just use count underscores  my string    in the rest of your code  Using advanced C   algorithms is certainly possible here  but I think it s overkill

User · Answer

You can find out occurrence of     in source string by using string functions  find   function takes 2 arguments   first - string whose occurrences we want to find out and second argument takes starting position While loop is use to find out occurrence till the end of source string   example   string str2        string strData    bla bla blabla bla     size t pos   0 pos2   while   pos   strData find str2  pos    lt  strData length           printf   n d   pos       pos    str2 length

User · Answer

Old-fashioned solution with appropriately named variables  This gives the code some spirit    include  lt cstdio gt  int   char     int     0 while                        1     return      int main   char      la blba bla  bla     printf  The string    s   contains  d   characters n                  Edit  about 8 years later  looking at this answer I m ashamed I did this  even though I justified it to myself as a snarky poke at a low-effort question   This is toxic and not OK  I m not removing the post  I m adding this apology to help shifting the atmosphere on StackOverflow  So OP  I apologize and I hope you got your homework right despite my trolling and that answers like mine did not discourage you from participating on the site

User · Answer

I would have done this way      include  lt iostream gt   include  lt string gt  using namespace std  int main      int count   0  string s  Hello world     for  int i   0  i  lt  s size    i                  if  s at i                         count          cout  lt  lt  endl  lt  lt  count  cin ignore    return 0

User · Answer

Try   include  lt iostream gt    include  lt string gt   using namespace std    int WordOccurrenceCount  std  string const  amp  str  std  string const  amp  word            int count 0          std  string  size type word pos  0           while   word pos  std  string  npos                           word pos   str find word  word pos                   if   word pos    std  string  npos                                             count               start next search after this word                         word pos    word length                                      return count      int main         string sting1  theeee peeeearl is in theeee riveeeer      string word1  e      cout lt  lt word1 lt  lt   occurs   lt  lt WordOccurrenceCount sting1 word1  lt  lt   times in    lt  lt sting1  lt  lt     n n       return 0

User · Answer

include  lt algorithm gt   std  string s    a b c   size t n   std  count s begin    s end

User · Answer

There are several methods of std  string for searching  but find is probably what you re looking for   If you mean a C-style string  then the equivalent is strchr   However  in either case  you can also use a for loop and check each character   the loop is essentially what these two wrap up   Once you know how to find the next character given a starting position  you continually advance your search  i e  use a loop   counting as you go

User · Answer

public static void main String   args            char   array    aabsbdcbdgratsbdbcfdgs  toCharArray            char     countArr   new char array length  2           int lastIndex   0          for  char c   array                int foundIndex   -1              for  int i   0  i  lt  lastIndex  i                      if  countArr i  0     c                        foundIndex   i                      break                                              if  foundIndex  gt   0                    int a   countArr foundIndex  1                   countArr foundIndex  1     char    a                else                   countArr lastIndex  0    c                  countArr lastIndex  1     1                   lastIndex                                    for  int i   0  i  lt  lastIndex  i                  System out println countArr i  0          countArr i  1

User · Answer

I would have done something like that     const char  str    bla bla blabla bla   char  p   str      unsigned int count   0  while   p      0       if   p                   count

User · Answer

You name it    Lambda version        using namespace boost  lambda   std  string s    a b c   std  cout  lt  lt  std  count if  s begin    s end     1          lt  lt  std  endl    You need several includes    I leave you that as an exercise

[c++] Count character occurrences in a string in C++

Examples related to c++

Examples related to string

Examples related to pattern-matching