refactor:Simplified lambda expressions for PriorityQueue in heap.md a…

…nd heap.java (krahets#379)
lilongthinker · Feb 22, 2023 · f2d2cca · f2d2cca
1 parent a2b7494
commit f2d2cca
Show file tree

Hide file tree

Showing 2 changed files with 2 additions and 2 deletions.
diff --git a/codes/java/chapter_heap/heap.java b/codes/java/chapter_heap/heap.java
@@ -28,7 +28,7 @@ public static void main(String[] args) {
         // 初始化小顶堆
         Queue<Integer> minHeap = new PriorityQueue<>();
         // 初始化大顶堆（使用 lambda 表达式修改 Comparator 即可）
-        Queue<Integer> maxHeap = new PriorityQueue<>((a, b) -> { return b - a; });
+        Queue<Integer> maxHeap = new PriorityQueue<>((a, b) -> b - a);
 
         System.out.println("\n以下测试样例为大顶堆");
 

diff --git a/docs/chapter_heap/heap.md b/docs/chapter_heap/heap.md
@@ -52,7 +52,7 @@ comments: true
     // 初始化小顶堆
     Queue<Integer> minHeap = new PriorityQueue<>();
     // 初始化大顶堆（使用 lambda 表达式修改 Comparator 即可）
-    Queue<Integer> maxHeap = new PriorityQueue<>((a, b) -> { return b - a; });
+    Queue<Integer> maxHeap = new PriorityQueue<>((a, b) -> b - a);
 
     /* 元素入堆 */
     maxHeap.add(1);