Algorithms/LeetCodeAnimation
1
0
Fork 0
mirror of https://gitee.com/TheAlgorithms/LeetCodeAnimation.git synced 2024-12-06 15:19:44 +08:00
Code Issues Actions Packages Projects Releases Wiki Activity

Merge pull request #130 from jesee030/fix_spell

Browse Source 
Update 0004-median-of-two-sorted-arrays.md
This commit is contained in:
程序员吴师兄 2021-06-24 11:37:22 +08:00 committed by GitHub
commit 06076dec05
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
0004-median-of-two-sorted-arrays/Article/0004-median-of-two-sorted-arrays.md
View File

@ -42,7 +42,7 @@ nums2 = [3, 4]
![](../Animation/image2.PNG)
如图，我们要找到一组A，B，满足上面3条规则。
对于规则1，我们在数组1中找任意A，然后根据规则1就能推算出对应的B的位置。
对于规则2，由于数组1和2都是有序数组，即X1<A<Y1;X2<B<Y2。我们实际上只需要判断A是否小于Y2，以及B是否小于Y2。
对于规则2，由于数组1和2都是有序数组，即X1<A<Y1;X2<B<Y2。我们实际上只需要判断A是否小于Y2，以及B是否小于Y1。
对于规则3，由于数组1和2都是有序数组，因此中位数为A,B中较大的那一项。
那么具体该如何操作呢?