-
Notifications
You must be signed in to change notification settings - Fork 22
Expand file tree
/
Copy pathsolution004.cpp
More file actions
80 lines (71 loc) · 1.47 KB
/
solution004.cpp
File metadata and controls
80 lines (71 loc) · 1.47 KB
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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
/**
* @file Median of two sorted arrays.
*
* cpselvis([email protected])
* 2016.7.29
*/
#include<cstdio>
#include<vector>
using namespace std;
class Solution {
public:
double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
int size1 = nums1.size(), size2 = nums2.size();
if ((size1 + size2) % 2 == 0)
{
return (findKth(nums1, nums2, (size1 + size2) / 2) + findKth(nums1, nums2, (size1 + size2) / 2 + 1)) / 2;
}
else
{
return findKth(nums1, nums2, (size1 + size2 + 1) / 2);
}
}
// Merge and count to find Kth of two sorted arrays.
double findKth(vector<int>& nums1, vector<int>& nums2, int k)
{
int p = 0, q = 0; // Two pointers fo vector
int size1 = nums1.size(), size2 = nums2.size();
for (int i = 0; i < k - 1; i ++)
{
// Overflow case.
if (p >= size1)
{
q ++;
}
else if (q >= size2)
{
p ++;
}
else if (nums1[p] <= nums2[q])
{
p ++;
}
else
{
q ++;
}
}
if (p >= size1)
{
return nums2[q];
}
else if (q >= size2)
{
return nums1[p];
}
else
{
return min(nums1[p], nums2[q]);
}
}
};
int main(int argc, char **argv)
{
int arr1[] = {1, 3};
int arr2[] = {2, 4, 6, 8, 10};
vector<int> nums1(arr1 + 0, arr1 + 2);
vector<int> nums2(arr2 + 0, arr2 + 5);
Solution s;
double result = s.findMedianSortedArrays(nums1, nums2);
printf("%f\n", result);
}