leetcode/csharp/0004-median-of-two-sorted-arrays.cs at main · ColstonBod-oy/leetcode · GitHub

Name: leetcode/csharp/0004-median-of-two-sorted-arrays.cs at main · ColstonBod-oy/leetcode · GitHub
Rating: 4.4 (7832 reviews)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
publicclassSolution{
publicdoubleFindMedianSortedArrays(int[]nums1,int[]nums2)
{
if(nums1.Length<=0&&nums2.Length==1)
{
returnnums2[0];
}
if(nums2.Length<=0&&nums1.Length==1)
{
returnnums1[0];
}

varm=nums1.Length;
varn=nums2.Length;
if(m>n)
{
returnFindMedianSortedArrays(nums2,nums1);
}
vartotal=m+n;
varhalf=(total+1)/2;
varleft=0;
varright=m;
varresult=0.0;
while(left<=right)
{
vari=left+(right-left)/2;
varj=half-i;
varleft1=(i>0)?nums1[i-1]:int.MinValue;
varright1=(i<m)?nums1[i]:int.MaxValue;
varleft2=(j>0)?nums2[j-1]:int.MinValue;
varright2=(j<n)?nums2[j]:int.MaxValue;

if(left1<=right2&&left2<=right1)
{
if(total%2==0)
{
result=(Math.Max(left1,left2)+Math.Min(right1,right2))/2.0;
}
else
{
result=Math.Max(left1,left2);
}
break;
}
elseif(left1>right2)
{
right=i-1;
}
else
{
left=i+1;
}
}
returnresult;
}
}