How can this solution with a for-loop inside a while loop have a time-complexity that is not O(n^2)

Question

Can someone explain to me why Cracking the Coding Interview says that this algorithm has a time complexity of O(P + D)? Is it not O(n^2)?

public stat