Median of Two Sorted Arrays

Submission Detail

2094 / 2094 test cases passed.
 Status:

Accepted
Runtime: 16 ms
Memory Usage: 6.5 MB
Submitted: 1 day, 2 hours ago

Accepted Solutions Runtime Distribution

0
5
10
15
20
25
30
35
40
45
50
55
60
65
70
5
10
15
20
25
30
c
You are here!
Your runtime beats 54.93 % of c submissions.
Runtime (ms)
Distribution (%)

0
5
10
15
20
25
30
35
40
45
50
55
60
65
70
10
20
30
Zoom area by dragging across this chart

Accepted Solutions Memory Distribution

6600
6200
6300
6400
6500
6700
6800
6900
7000
5
10
15
20
c
You are here!
Your memory usage beats 72.30 % of c submissions.
Memory (KB)
Distribution (%)

6600
6200
6300
6400
6500
6700
6800
6900
7000
10
20
Zoom area by dragging across this chart

Invite friends to challenge Median of Two Sorted Arrays

Submitted Code: 1 day, 2 hours ago

Language: c

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
double findMedianSortedArrays(int *nums1, int nums1Size, int *nums2, int nums2Size)
{
#define get_cn(s, n) \
do \
{ \
if (n % 2 == 0) \
{ \
return (s[n / 2] + s[n / 2 - 1]) / 2.0; \
} \
else \
{ \
return s[n / 2]; \
} \
} while (0);
while (nums1Size >= 1 && nums2Size >= 1 && nums1Size + nums2Size > 2)
{
if (nums1[0] >= nums2[0])
{
nums2++;
nums2Size--;
}
else
{
nums1++;
nums1Size--;
}
if (nums1[nums1Size - 1] >= nums2[nums2Size - 1])
{
nums1Size--;
}
else
{
nums2Size--;
}
}
if (nums1Size==0){
get_cn(nums2,nums2Size);
}else if (nums2Size==0){
get_cn(nums1,nums1Size);
}else{
return (nums1[0]+nums2[0])/2.0;
}
}

Back to problem