count duplicate in a sorted array

最新推荐文章于 2023-03-15 01:53:52 发布

zhaobaoxue

最新推荐文章于 2023-03-15 01:53:52 发布

阅读量519

点赞数

分类专栏：算法

本文链接：https://blog.csdn.net/starmsg/article/details/40074825

版权

算法专栏收录该内容

3 篇文章 0 订阅

订阅专栏

count insead of find. binary search.

#include <iostream>
#include <map>
using namespace std;

map<int, int> blist;
 
void count_dup(int* arr, int start, int end)
{
    if(end == start)
    {
        blist[arr[start]] +=1;
        return;
    }
        
    if(start<end) 
    {        
        if(arr[start] == arr[end]) 
        {
            blist[arr[end]] += end - start + 1;
            return;
        }
 
        int mid = start + (end-start)/2;
        count_dup(arr, start, mid);
        count_dup(arr, mid+1, end);
    }
}
 
int main()
{
    int A[] = {1,2,2,3,3,3,4,4,4,5,5,5,5,6,6,6,6,7,7,8,9};
    count_dup(A, 0,20);
 
    map<int, int>::iterator iter = blist.begin();
    while(iter != blist.end())
    {
        cout << iter->first << ": " << iter->second << endl;
        iter++;
    }
    return 0;
}