-->
当前位置:首页 > Luz 第6874页
Luz

Luz 管理员

暂无介绍

89858 篇文章 33 次评论

计算$$x^y$$,有以下三种方法:

Luz5年前 (2021-05-10)1804
计算$$x^y$$,有以下三种方法: (1) x**y; (2) pow(x,y); (3) import random random.pow(x,y) ~@[](3)答案:FALSE…

已知 x = 3,那么执行语句 x+=6 之后,x的内存地址不变。

Luz5年前 (2021-05-10)5145
已知 x = 3,那么执行语句 x+=6 之后,x的内存地址不变。 ~@[](2)答案:FALSE…

在Python中0xad是合法的十六进制数字表示形式。

Luz5年前 (2021-05-10)2211
在Python中0xad是合法的十六进制数字表示形式。~@[](2)答案:TRUE…

“==”和“=”都属于赋值运算符。

Luz5年前 (2021-05-10)2171
“==”和“=”都属于赋值运算符。 ~@[](1)答案:FALSE…

表达式 pow(3,2) == 3**2的值为True。

Luz5年前 (2021-05-10)5417
表达式 pow(3,2) == 3**2的值为True。 ~@[](2)答案:TRUE…

In backtracking, if different solution spaces have different siz

Luz5年前 (2021-05-10)1118
In backtracking, if different solution spaces have different sizes, start testing from the partial solution with the lar…

A perfectly balanced tree forms if keys 1 to $$2^k -1$$ are inse

Luz5年前 (2021-05-10)1107
A perfectly balanced tree forms if keys 1 to $$2^k -1$$ are inserted in order into an initally empty leftist heap. ~@[](…

A perfectly balanced tree forms if keys 1 to $$2^k -1$$ are inse

Luz5年前 (2021-05-10)1130
A perfectly balanced tree forms if keys 1 to $$2^k -1$$ are inserted in order into an initally empty skew heap. ~@[](2)…

In a red-black tree, the number of rotations in the DELETE opera

Luz5年前 (2021-05-10)1180
In a red-black tree, the number of rotations in the DELETE operation is O(1). ~@[](2) 答案:TRUE…

Givien two $$n\times n$$ matrices $$A$$ and $$B$$, the time comp

Luz5年前 (2021-05-10)1336
Givien two $$n\times n$$ matrices $$A$$ and $$B$$, the time complexity of the simple matrix multiplication $$C = A \cdot…