【单选题】Pushing sequence of a stack is {1,2, ⋯ ,n } .If the i th number of popping sequence is j,then how many possible choices are there for the (i−1)th one? (i+j
【单选题】Pushing sequence of a stack is {1,2, ⋯ ,n } .If the second number of popping sequence is n,then how many possible choices are there for the first one?