Merge pull request neetcode-gh#980 from samirangode/samirangode-patch-1

Update 4_Median_of_Two_Sorted_Arrays.cpp

Author: Ahmad-A0

cpp/neetcode_150/05_binary_search/median_of_two_sorted_arrays.cpp

@@ -21,6 +21,15 @@ class Solution {
         if (m > n) {
             return findMedianSortedArrays(nums2, nums1);
         }
+        if(m==0){
+            if(n%2==0){
+                return (nums2[n/2 - 1] + nums2[n/2])/2.0;
+            }else{
+            cout<<n/2;
+                
+                return nums2[n/2];
+            }
+        }
 
         int total = m + n;