feat: update solutions to lcof problem: No.40

Author: yanglbme

.github/workflows/prettier.yml

@@ -15,7 +15,7 @@ jobs:
         ref: ${{ github.head_ref }}
 
     - name: Prettify code
-      uses: creyD/prettier_action@v3.0
+      uses: creyD/prettier_action@v3.3
       with:
         prettier_options: --write **/*.{js,c,cpp,go,rb,java,cs,py,scala,md}
         commit_message: 'style: prettify code'

lcof/面试题40. 最小的k个数/README.md

@@ -54,11 +54,9 @@ class Solution {
         for (int e : arr) {
             if (bigRoot.size() < k) {
                 bigRoot.offer(e);
-            } else {
-                if (e < bigRoot.peek()) {
-                    bigRoot.poll();
-                    bigRoot.offer(e);
-                }
+            } else if (e < bigRoot.peek()) {
+                bigRoot.poll();
+                bigRoot.offer(e);
             }
         }
         int[] res = new int[k];

lcof/面试题40. 最小的k个数/Solution.java

@@ -7,11 +7,9 @@ public int[] getLeastNumbers(int[] arr, int k) {
         for (int e : arr) {
             if (bigRoot.size() < k) {
                 bigRoot.offer(e);
-            } else {
-                if (e < bigRoot.peek()) {
-                    bigRoot.poll();
-                    bigRoot.offer(e);
-                }
+            } else if (e < bigRoot.peek()) {
+                bigRoot.poll();
+                bigRoot.offer(e);
             }
         }
         int[] res = new int[k];