CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-13 18:00:18 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update Dart code to output same as Java (#522)

Browse Source
This commit is contained in:
liuyuxin
2023-05-30 13:00:16 +08:00
committed by GitHub
parent 5bbcb12979
commit 8247a611d7
14 changed files with 47 additions and 42 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -138,7 +138,7 @@ void main() {
/* 获取双向队列的长度 */
final int size = deque.size();
print("双向队列的长度 size = $size");
print("双向队列长度 size = $size");
/* 判断双向队列是否为空 */
final bool isEmpty = deque.isEmpty();

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

@@ -99,7 +99,7 @@ void main() {
/* 判断队列是否为空 */
final bool isEmpty = queue.isEmpty();
print("队列是否为空 isEmpty = $isEmpty");
print("队列是否为空 = $isEmpty");
/* 测试环形数组 */
for (int i = 0; i < 10; i++) {

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

@@ -9,13 +9,9 @@ import 'dart:collection';
void main() {
/* 初始化双向队列 */
final Queue<int> deque = Queue();
/* 元素入队 */
deque.addFirst(3);
deque.addLast(2);
deque.addLast(5);
deque.addLast(4);
deque.addFirst(3);
deque.addFirst(1);
print("双向队列 deque = $deque");
/* 访问元素 */
@@ -24,17 +20,24 @@ void main() {
final int peekLast = deque.last;
print("队尾元素 peekLast = $peekLast");
/* 元素入队 */
deque.addLast(4);
print("元素 4 队尾入队后 deque = $deque");
deque.addFirst(1);
print("元素 1 队首入队后 deque = $deque");
/* 元素出队 */
final int popFirst = deque.removeFirst();
print("队首出队元素 popFirst = $popFirst，队首出队后 deque = $deque");
final int popLast = deque.removeLast();
print("队尾出队元素 popLast = $popLast，队尾出队后 deque = $deque");
print("队尾出队元素 = $popLast，队尾出队后 deque = $deque");
final int popFirst = deque.removeFirst();
print("队首出队元素 = $popFirst，队首出队后 deque = $deque");
/* 获取双向队列的长度 */
final int size = deque.length;
print("双向队列的长度 size = $size");
print("双向队列长度 size = $size");
/* 判断双向队列是否为空 */
final bool isEmpty = deque.isEmpty;
print("双向队列是否为空 isEmpty = $isEmpty");
print("双向队列是否为空 = $isEmpty");
}

4
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;
@@ -33,5 +33,5 @@ void main() {
/* 判断队列是否为空 */
final bool isEmpty = queue.isEmpty;
print("队列是否为空 isEmpty = $isEmpty");
print("队列是否为空 = $isEmpty");
}

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

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