Question

I need to count letters from the string, sort them by count and cout results. For this purpose I’m trying to use vector and struct. Here is part of my code, but it’s not working, because I don’t know how to implement something:

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;

struct int_pair{
     int key;
     int value;
};  

bool sort_by_value(int_pair left, int_pair right){
    return left.value < right.value;
}

int main() {    
    string characters = "aasa asdfs dfh f ukjyhkh k wse f sdf sdfsdf";    
    vector<int_pair> most_frequent;     

    for (string::size_type i = 0; i <= characters.length(); i++) {
        int int_char = (int)characters[i];
        most_frequent[int_char]++; <-- I want to do something like this, but it's not working 
    }

    sort(most_frequent.begin(), most_frequent.end(), sort_by_value);

    for (vector<int_pair>::iterator it = most_frequent.begin(); it != most_frequent.end(); ++it) <-- is this call correct?
        cout << " " << it->key << ":" << it->value << endl;    

    return 0;
}

At this code I have 2 parts that I don’t know how to deal:

most_frequent[int_char]++; <-- I want to do something like this, but it's not working 

and

for (vector<int_pair>::iterator it = most_frequent.begin(); it != most_frequent.end(); ++it) <-- is this call correct?

Maybe you can see any other mistakes and potential issues at this code.

Answer 1

This should do what you need:

most_frequent[int_char].key = int_char;
most_frequent[int_char].value++; 

Yes, it sets the key many times, even though it doesn’t need to.