[leetcode]-274. H-Index（C语言）

Given an array of citations (each citation is a non-negative integer) of a researcher, write a function to compute the researcher's h-index.

According to the definition of h-index on Wikipedia: "A scientist has index h if h of his/her N papers have at least h citations each, and the other N − h papers have no more than h citations each."

Example:

Input: citations = [3,0,6,1,5]

Output: 3

Explanation: [3,0,6,1,5] means the researcher has 5 papers in total and each of them had

             received 3, 0, 6, 1, 5 citations respectively.

             Since the researcher has 3 papers with at least 3 citations each and the remaining

             two with no more than 3 citations each, her h-index is 3.

Note: If there are several possible values for h, the maximum one is taken as the h-index.

int hIndex(int* citations, int citationsSize) {
    if(citationsSize<=0)
        return 0;
    int i,j,k,tem,h;
    int a[citationsSize];
    for(i=0;i<citationsSize-1;i++)
    {
        k=i;
        for(j=i+1;j<citationsSize;j++)
            if(citations[k]>citations[j])
                k=j;
        if(k!=i)
        {
            tem=citations[k];
            citations[k]=citations[i];
            citations[i]=tem;
        }
    }
    h=0;
    for(i=1;i<=citationsSize;i++)
    {
        for(j=0;j<citationsSize;j++)
        {
            if(citations[j]>=i)
            {
                tem=citationsSize-j;
                if(i==tem)
                {
                    h=i;
                    break;
                }
            }
        }
    }
    return h;
}