Minor modification to Merge K Sorted Lists

only-dev-ops · only-dev-ops · commit 44877ff9a076 · 2020-01-28T15:21:43.000-08:00
diff --git a/LeetCode solutions.md b/LeetCode solutions.md
@@ -4221,9 +4221,9 @@ public ListNode mergeKLists(ListNode[] lists) {
     if (lists.length == 0)
         return null;
     PriorityQueue<ListNode> pq = new PriorityQueue<>(lists.length, (n1, n2) -> n1.val - n2.val);
-    for (int i = 0; i < lists.length; ++i)
-        if (lists[i] != null)
-            pq.add(lists[i]);
+    for (ListNode ln: lists)
+        if (ln != null)
+            pq.add(ln);
     if (pq.isEmpty())
         return null;
     ListNode node = new ListNode(-1);
