class Solution {
public int hIndex(int[] citations) {
int l=citations.length;
Arrays.sort(citations);//对数组排序
int count=0;
for(int i=l-1;i>=0;i--){//从后向前找
if(citations[i]<=count) return count;
count++;
}
return count;
}
}