Hamiltonian degree sequences in digraphs

We show that for each η>0 every digraph G of sufficiently large order n is Hamiltonian if its out- and indegree sequences and satisfy (i) or and (ii) or for all i