The first one:大理石在哪现有N个大理石,每个大理石上写了一个非负整数。首先把各数从小大大排序,然后回答Q个问题。每个问题问是否一个大理石写着某个整数x,如果是,还要问那个大理石写着x。排序后的大理石从左到右编号为1~N。
(相关资料图)
The code is as follows:
The second one:木块问题从左至右右n个木块,编号0~n-1,要求模拟以下四种操作move a onto b a与b上方的木块全部归位,然后把a放在b的上面move a over b a上方的木块全部归位,然后把a放在b所在木块堆的上面pile a onto b b上方的木块全部归位,然后把a及以上的木块放在b的上面pile a over b 把a及以上的木块放在b所在木块堆的上面
The code is as follows
The third one:安迪的第一个字典输入一个文本,找出所以不同的单词,按照字典顺序从小到大输出
The code is as follows
The fourth one:反片语输入一些单词,找出所有满足如下条件的单词:该单词不能通过字母重排,得到输入文本的另外一些单词。在判断是否满足条件时,字母不分大小写,但在输出时应保留输入中的大小写,按照字典序进行排序
The code is as follows
The fifth one:集合栈计算机
The code is as follows:
The sixth one:
Problem Analysis
The code is as follows
The seventh one:
Problem Analysis
The code is as follows
The eighth one
The code is as follows
标签:
X 关闭
X 关闭