Leetcode 275: H-Index II (linear)

leetcode_275a.cpp

#include <iostream>
#include <vector>

using namespace std;

int hIndex(vector<int>& citations) {
    int h=0, len=citations.size();
    for (int i=len-1; i>=0; --i) {
        if (citations[i] >= len-i) h++;
        else break;
    }
    return h;
}

int main() {
    vector<int> citations {0,1,3,5,6};
    cout << hIndex(citations) << "\n";
    return 0;
}