c++ return 将向量中出现n次的所有元素作为向量

c++ return all of the elements that appear n times in a vector as a vector

目标: Return 向量 A 中出现 N 次并将结果放入向量 B.[=17= 中的所有元素]

预期结果:

--Begin With---

Vector A=(10,20,30,30,40,50,100,50,20,100,10,10,200,300)

Do some code to return the name of elements that appear in Vector A
when N=3

Result should be Vector B=(10) //because only 10 is in vector A N=3 times.

我的尝试: 我得到了放置在另一个向量中的所有元素的计数,但我没有可以返回所有出现 N 次的元素的部分。 如果这意味着速度提高,我对如何完成非常灵活

#include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <iterator>     // std::back_inserter
#include <algorithm>    // std::copy

int main()
{
    std::vector<int> v{ 1, 2, 3, 4, 4, 3, 7, 8, 9, 10 };

    std::vector<std::pair<int, int> > shows;
    int target1;
    int num_items1;
    int size = static_cast<int>(v.size());

    for(int x=0; x<size; x++)
    {
        target1 = v[x];

        num_items1 = std::count(v.begin(), v.end(), target1);

        shows.push_back(std::make_pair(target1, num_items1));

        std::cout << "number: " << target1 << " count: " << num_items1 << '\n';
    } 
}

接受的问题解决方案

#include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <iterator>     // std::back_inserter
#include <algorithm>    // std::copy
#include <set>
#include <map>

using namespace std;

int main()
{
    std::vector<int> v{ 1, 2, 3, 4, 4, 3, 7, 8, 9, 10 };

    std::vector<int> shows;
    std::map<int, int> freqOfv;

    for(const auto& i: v)
    {
        freqOfv[i]++;
    }

    std::set<int> s(v.begin(), v.end());

    int N = 2; //Can be read from stdin as well...

    for ( auto it = s.begin(); it != s.end(); it++ )

    {
        if(freqOfv[*it] ==N)
        {

            shows.push_back(*it);
        }
    }

    for (std::vector<int>::const_iterator i = shows.begin(); i != shows.end(); ++i)
    {
        std::cout << *i << ' ';
    }
    return 0;
    }

如评论中所建议,std::map 将简化代码:

int main()
{
    std::vector<int> v{ 1, 2, 3, 4, 4, 3, 7, 8, 9, 10 };    
    std::map<int, int> freqOfv; 
    for(const auto& i: v)
        freqOfv[i]++;

    int N = 2; //Can be read from stdin as well...

    for(const auto& i: freqOfv)
    {
        if(N == i.second)
            std::cout << "The value " << i.first << " occurs " << N << " times." << std::endl;
    }   
}

这会产生以下输出:

The value 3 occurs 2 times.
The value 4 occurs 2 times.

当然,您需要#include <map>开头才能在您的代码中使用地图。