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

feat: add dart code for chapter_stack_and_queue and chapter_hashing (#445)

Browse Source 
* feat: add dart code for chapter stack and queue

* feat: add dart code for chapter_hashing

* Update array_hash_map.dart
This commit is contained in:
liuyuxin
2023-03-30 02:03:08 +08:00
committed by GitHub
parent cac38c0c93
commit 684f27cf5e
11 changed files with 975 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

40
codes/dart/chapter_stack_and_queue/deque.dart Normal file
View File

@@ -0,0 +1,40 @@
/**
* File: deque.dart
* Created Time: 2023-03-28
* Author: liuyuxin (gvenusleo@gmail.com)
*/
import 'dart:collection';
void main() {
/* 初始化双向队列 */
final Queue<int> deque = Queue();
/* 元素入队 */
deque.addLast(2);
deque.addLast(5);
deque.addLast(4);
deque.addFirst(3);
deque.addFirst(1);
print("双向队列 deque = $deque");
/* 访问元素 */
final int peekFirst = deque.first;
print("队首元素 peekFirst = $peekFirst");
final int peekLast = deque.last;
print("队尾元素 peekLast = $peekLast");
/* 元素出队 */
final int popFirst = deque.removeFirst();
print("队首出队元素 popFirst = $popFirst，队首出队后 deque = $deque");
final int popLast = deque.removeLast();
print("队尾出队元素 popLast = $popLast，队尾出队后 deque = $deque");
/* 获取双向队列的长度 */
final int size = deque.length;
print("双向队列的长度 size = $size");
/* 判断双向队列是否为空 */
final bool isEmpty = deque.isEmpty;
print("双向队列是否为空 isEmpty = $isEmpty");
}