Update Median of Two Sorted Arrays

AAAA-source · web-flow · commit b2de5fc202a5 · 2025-02-12T23:46:28.000+08:00
diff --git a/精選高頻HARD題目/Median of Two Sorted Arrays b/精選高頻HARD題目/Median of Two Sorted Arrays
@@ -2,7 +2,7 @@
 使之符合 partitionA + partitionB = (m + n + 1) / 2 
 切出 nums1[0 .. partitionA - 1] , nums2[0 .. partitionB - 1] 以及 nums1[partitionA .. m] , nums2[partitionB .. n]
 且 nums1[partitionA - 1] <= nums2[partitionB] and nums2[partitionB - 1] <= nums1[partitionA] 
-這樣就代表剛好切到中線上，反之則依照大小關係向左向右推進
+這樣就代表剛好切到中線上，反之則依照大小關係向左或向右推進
 
 Time Complexity : O( log(min(m , n))) for binary searching on the smaller array
 Space Complexity : O(1) for variables
