-->
当前位置:首页 > 题库

题库 第6666页

  • 最新
  • 浏览
  • 评论

对于两个字符串变量s1和s2,使用if(s1>s2)来比较大小是可以的。

Luz5年前 (2021-05-10)1553
对于两个字符串变量s1和s2,使用if(s1˃s2)来比较大小是可以的。 ~@[](1)答案:FALSE…

只有当局部最优跟全局最优解一致的时候,贪心法才能给出正确的解。

Luz5年前 (2021-05-10)1687
只有当局部最优跟全局最优解一致的时候,贪心法才能给出正确的解。 ~@[](1)答案:TRUE…

The root of an optimal binary search tree always contains the ke

Luz5年前 (2021-05-10)1322
The root of an optimal binary search tree always contains the key with the highest search probability. ~@[](3)答案:FALSE…

在定义嵌套的结构类型时,必须先定义成员的结构类型,再定义主结构类型。

Luz5年前 (2021-05-10)3201
在定义嵌套的结构类型时,必须先定义成员的结构类型,再定义主结构类型。 ~@[](1)答案:TRUE…

Random access to any key value can be done in $$O(logN)$$ in a m

Luz5年前 (2021-05-10)1375
Random access to any key value can be done in $$O(logN)$$ in a max-heap of $$N$$ elements. ~@[](2)答案:FALSE…

The Fibonacci number sequence {$$F_N$$} is defined as: $$F_0=0$$

Luz5年前 (2021-05-10)1347
The Fibonacci number sequence {$$F_N$$} is defined as: $$F_0=0$$, $$F_1=1$$, $$F_N=F_{N-1}+F_{N-2}$$, $$N$$=2, 3, ....…

The Fibonacci number sequence {$$F_N$$} is defined as: $$F_0=0$$

Luz5年前 (2021-05-10)1271
The Fibonacci number sequence {$$F_N$$} is defined as: $$F_0=0$$, $$F_1=1$$, $$F_N=F_{N-1}+F_{N-2}$$, $$N$$=2, 3, ....…

$$N^2 logN$$ and $$N logN^2$$ have the same speed of growth.

Luz5年前 (2021-05-10)974
$$N^2 logN$$ and $$N logN^2$$ have the same speed of growth. ~@[](2)答案:FALSE…

Given that the pushing sequence of a stack is { 1, 2, $$\cdots$$

Luz5年前 (2021-05-10)1293
Given that the pushing sequence of a stack is { 1, 2, $$\cdots$$, $$n$$ } and popping sequence is { $$x_1, x_2, \cdots,…

Given a binary search tree with 20 integer keys which include 7,

Luz5年前 (2021-05-10)1292
Given a binary search tree with 20 integer keys which include 7, 8, and 9, if 7 and 9 are on the same level, then 8 must…