algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-02 12:58:42 +08:00
Code Issues Packages Projects Releases Wiki Activity

fine tune

Browse Source
This commit is contained in:
krahets
2023-09-17 01:13:15 +08:00
parent b2246e11a7
commit 9f59c572b5
32 changed files with 44 additions and 44 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
codes/dart/chapter_stack_and_queue/array_deque.dart
View File

@ -132,9 +132,9 @@ void main() {
/* 元素出队 */
final int popLast = deque.popLast();
print("队尾出队元素 = $popLast，队尾出队后 deque = ${deque.toArray()}");
print("队尾出队元素 = $popLast ，队尾出队后 deque = ${deque.toArray()}");
final int popFirst = deque.popFirst();
print("队首出队元素 = $popFirst，队首出队后 deque = ${deque.toArray()}");
print("队首出队元素 = $popFirst ，队首出队后 deque = ${deque.toArray()}");
/* 获取双向队列的长度 */
final int size = deque.size();

2
codes/dart/chapter_stack_and_queue/array_queue.dart
View File

@ -91,7 +91,7 @@ void main() {
/* 元素出队 */
final int pop = queue.pop();
print("出队元素 pop = $pop，出队后 queue = ${queue.toArray()}");
print("出队元素 pop = $pop ，出队后 queue = ${queue.toArray()}");
/* 获取队列长度 */
final int size = queue.size();

2
codes/dart/chapter_stack_and_queue/array_stack.dart
View File

@ -65,7 +65,7 @@ void main() {
/* 元素出栈 */
final int pop = stack.pop();
print("出栈元素 pop = $pop，出栈后 stack = ${stack.toArray()}");
print("出栈元素 pop = $pop ，出栈后 stack = ${stack.toArray()}");
/* 获取栈的长度 */
final int size = stack.size();

4
codes/dart/chapter_stack_and_queue/deque.dart
View File

@ -28,9 +28,9 @@ void main() {
/* 元素出队 */
final int popLast = deque.removeLast();
print("队尾出队元素 = $popLast，队尾出队后 deque = $deque");
print("队尾出队元素 = $popLast ，队尾出队后 deque = $deque");
final int popFirst = deque.removeFirst();
print("队首出队元素 = $popFirst，队首出队后 deque = $deque");
print("队首出队元素 = $popFirst ，队首出队后 deque = $deque");
/* 获取双向队列的长度 */
final int size = deque.length;

6
codes/dart/chapter_stack_and_queue/linkedlist_deque.dart
View File

@ -38,7 +38,7 @@ class LinkedListDeque {
void push(int num, bool isFront) {
final ListNode node = ListNode(num);
if (isEmpty()) {
// 若链表为空，则令 _front，_rear 都指向 node
// 若链表为空，则令 _front 和 _rear 都指向 node
_front = _rear = node;
} else if (isFront) {
// 队首入队操作
@ -153,9 +153,9 @@ void main() {
/* 元素出队 */
int? popLast = deque.popLast();
print("队尾出队元素 = $popLast，队尾出队后 deque = ${deque.toArray()}");
print("队尾出队元素 = $popLast ，队尾出队后 deque = ${deque.toArray()}");
int? popFirst = deque.popFirst();
print("队首出队元素 = $popFirst，队首出队后 deque = ${deque.toArray()}");
print("队首出队元素 = $popFirst ，队首出队后 deque = ${deque.toArray()}");
/* 获取双向队列的长度 */
int size = deque.size();

2
codes/dart/chapter_stack_and_queue/linkedlist_queue.dart
View File

@ -91,7 +91,7 @@ void main() {
/* 元素出队 */
final int pop = queue.pop();
print("出队元素 pop = $pop，出队后 queue = ${queue.toArray()}");
print("出队元素 pop = $pop ，出队后 queue = ${queue.toArray()}");
/* 获取队列的长度 */
final int size = queue.size();

2
codes/dart/chapter_stack_and_queue/linkedlist_stack.dart
View File

@ -81,7 +81,7 @@ void main() {
/* 元素出栈 */
final int pop = stack.pop();
print("出栈元素 pop = $pop，出栈后 stack = ${stack.toList()}");
print("出栈元素 pop = $pop ，出栈后 stack = ${stack.toList()}");
/* 获取栈的长度 */
final int size = stack.size();

2
codes/dart/chapter_stack_and_queue/queue.dart
View File

@ -25,7 +25,7 @@ void main() {
/* 元素出队 */
final int pop = queue.removeFirst();
print("出队元素 pop = $pop，出队后 queue = $queue");
print("出队元素 pop = $pop ，出队后 queue = $queue");
/* 获取队列长度 */
final int size = queue.length;

2
codes/dart/chapter_stack_and_queue/stack.dart
View File

@ -23,7 +23,7 @@ void main() {
/* 元素出栈 */
final int pop = stack.removeLast();
print("出栈元素 pop = $pop，出栈后 stack = $stack");
print("出栈元素 pop = $pop ，出栈后 stack = $stack");
/* 获取栈的长度 */
final int size = stack.length;

2
codes/dart/chapter_tree/avl_tree.dart
View File

@ -214,5 +214,5 @@ void main() {
/* 查询节点 */
TreeNode? node = avlTree.search(7);
print("\n查找到的节点对象为 $node，节点值 = ${node!.val}");
print("\n查找到的节点对象为 $node ，节点值 = ${node!.val}");
}

2
codes/dart/chapter_tree/binary_search_tree.dart
View File

@ -133,7 +133,7 @@ void main() {
/* 查找节点 */
TreeNode? node = bst.search(7);
print("\n查找到的节点对象为 $node，节点值 = ${node?.val}");
print("\n查找到的节点对象为 $node ，节点值 = ${node?.val}");
/* 插入节点 */
bst.insert(16);