查找统计,大虾帮帮忙吧
已知:
1) struct CIRCLE_POINT
{
int x;
int y;
int mark;
};
2) deque<CIRCLE_POINT> CirclePoint;
3) for (int i = 0; i < CirclePoint.size(); i ++)
{
for (int j = 1; j < CirclePoint.size(); j++)
{
int comp = memcmp(&CirclePoint[i], &CirclePoint[j], 3 * sizeof(int)); //if equal,return 0
if (!comp)
{
parray_circle[i]++;
CirclePoint.erase(CirclePoint.begin() + j - 1); // if equal ,delete it, it will not be done memcmp again.
}
}
}
说明:查找统计在CirclePoint中出现频率最高的元素,在数组parray_circle中保存频率次数。
要求:不许使用deque的erase操作(操作已经实现,如上面给出的,由于效率太低,舍弃),哪个高手能指点下~~~~(我觉得查找的关键是循环的实现,但是不出来如何实现……)