diff --git a/src/PriorityQueue/index.js b/src/PriorityQueue/index.js
index af95db4..3979f9f 100644
--- a/src/PriorityQueue/index.js
+++ b/src/PriorityQueue/index.js
@@ -1,4 +1,4 @@
-import PriorityQueue from './priorityQueue';
+import { PriorityQueue } from './priorityQueue';
 
 // ----- 优先队列结构测试 -----//
 console.log('// ----- 优先队列结构测试 START -----//');
diff --git a/src/PriorityQueue/priorityQueue.js b/src/PriorityQueue/priorityQueue.js
index e167c6e..3e1eb1e 100644
--- a/src/PriorityQueue/priorityQueue.js
+++ b/src/PriorityQueue/priorityQueue.js
@@ -1,24 +1,26 @@
-// 优先队列结构的封装
-export default class PriorityQueue {
+/**
+ * 优先队列结构的封装
+ */
 
-  constructor() {
-
-    this.items = [];
+// 优先队列内部的元素类
+class QueueElement {
+  constructor(element, priority) {
+    this.element = element;
+    this.priority = priority;
+  }
+}
 
-    // 内部类
-    this.QueueElement = class {
-      constructor(element, priority) {
-        this.element = element;
-        this.priority = priority;
-      }
-    };
+// 优先队列类
+export class PriorityQueue {
 
+  constructor() {
+    this.items = [];
   }
 
   // enqueue() 入队，将元素按优先级加入到队列中
   enqueue(element, priority) {
     // 根据传入的元素，创建 QueueElement 对象
-    const queueElement = new this.QueueElement(element, priority);
+    const queueElement = new QueueElement(element, priority);
 
     // 判断队列是否为空
     if (this.isEmpty()) {