Updated comments

CunningDJ · CunningDJ · commit c2d3abdf055a · 2022-05-02T18:08:44.000-04:00
diff --git a/GrokkingTwoHeaps.java b/GrokkingTwoHeaps.java
@@ -46,8 +46,8 @@ public static int kthLargest(int k, int[] nums) {
         }
 
 
-        // Could also separate the min/max into two separate while loops for further optimization, but
-        //   putting both checks in one while loop here to demonstrate the shared code
+        // Could also separate the min/max logic into two separate while loops for further optimization (max 1 condition 
+        //  checked per loop), but I'm putting both checks in one while loop here to demonstrate the shared code
         while (i < n) {
             if (// Min Heap: pushing LARGEST on
                 (checkingLargest && nums[i] > heap.peek()) ||

Original file line number	Diff line number	Diff line change
`@@ -46,8 +46,8 @@ public static int kthLargest(int k, int[] nums) {`
`46`	`46`	`}`
`47`	`47`
`48`	`48`
`49`		`- // Could also separate the min/max into two separate while loops for further optimization, but`
`50`		`- // putting both checks in one while loop here to demonstrate the shared code`
	`49`	`+ // Could also separate the min/max logic into two separate while loops for further optimization (max 1 condition`
	`50`	`+ // checked per loop), but I'm putting both checks in one while loop here to demonstrate the shared code`
`51`	`51`	`while (i < n) {`
`52`	`52`	`if (// Min Heap: pushing LARGEST on`
`53`	`53`	`(checkingLargest && nums[i] > heap.peek()) \|\|`