数组中取相同的元素算法实现

C++版：

#include <stdio.h>


void bubblesort(int array[],int num)
{
for(int i = 0; i < num; ++i)
{
for(int j = 0; j < num -i -1; ++j)
{
if(array[j]>array[j+1])
{
int temp = array[j];
array[j] = array[j+1];
array[j+1] = temp;
}
}
}
}

int main(int argc, char* argv[])
{
int aa[] = {12,34,12,34,56,78,78,100,100,100,123,56,56,12,100,34};
bubblesort(aa,sizeof(aa)/sizeof(int));
int big[sizeof(aa)/sizeof(int)] = {0};
int size = -9999;
int count = 0;
int index = 0;

for(int i = 0; i < sizeof(aa)/sizeof(int); ++i)
{
if(aa[i] == size)
{
count ++;
}
else
{
if(count != 0)
{
for(int j = 0; j <count+1; ++j)
{
big[index++] = size;
}
}
size = aa[i];
count = 0;
}
}

for(int i = 0; i < index; ++i)
{
printf("%d ",big[i]);
}

return 0;
}

lua代码实现：

local strArr = {12,312,312,33,45,64,3,312,33,23,12,312,12}
local tmp = {};
for i = 1 , #strArr do
    if not tmp[tostring(strArr[i])] then
        tmp[tostring(strArr[i])] = 1;
    else
        tmp[tostring(strArr[i])]  = tmp[tostring(strArr[i])] + 1;
    end
end
for k,v in pairs(tmp) do
    if v > 1 then
        for i = 1 , v do
            print(tostring(k)); 
        end
    end
end