星宇康的博客

是

下标从0开始计数，非递归写法 # include <iostream> # include <algorithm> void sift(int arr[], int start, int end) { int dad = start; int son = dad * 2; while (son <= end) { if (son < end && arr[son] < arr[son + 1]) {

Given a stack which can keep M numbers at most. Push N numbers in the order of 1, 2, 3, …, N and pop randomly. You are supposed to tell if a given sequence of numbers is a possible pop sequence of the...