①处应填()
i<j
i>j
i<=j
i>=j
②处应填()
next[rank[i-1]]-rank[i]
next[rank[i+1]]-rank[i]
next[i]-rank[i+1]
next[rank[i]]=rank[i+1]
③处应填()。
higher-height[next[i]]-height[i]
higher height[i]-height[previous[i]]
higher=max(higher,height[next[i]]-height[i])
higher=min(higher,height[next[i-height[i])
④处应填()。
shorter<=higher
shorter<higher
answer[i]>previous[i];
answer[i]<previous[i];
⑤处应填()。
next[previous[i]]-next[i]
previous[next[i]]-previous[i]
previous[next[i]]=next[i]
next[next[i]]=next[i]
发表评论