Leetcode 275: H-Index II

Follow up for H-Index: What if the citations array is sorted in ascending order? Could you optimize your algorithm?

 

public class Solution {
    public int HIndex(int[] citations) {
        int len = citations.Length;
        
        for (int i = 0; i < citations.Length; i++)
        {
            if (citations[i] >= len)
            {
                break;
            }
            else
            {
                len--;
            }
        }
        
        return len;
    }
}