leetcode/4.cpp at main · Aqiu16717/leetcode · GitHub

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
#include <iostream>
#include <vector>

using namespace std;

double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
    int m = nums1.size();
    int n = nums2.size();
    double ret;
    return ret;
}

void test() {
    vector<int> nums1;
    vector<int> nums2;
    double ret;

    cout << "nums1:{1, 3}, nums2:{2}" << endl;
    nums1 = {1, 3};
    nums2 = {2};
    ret = findMedianSortedArrays(nums1, nums2);
    cout << "ret:" << ret << endl;

    cout << "nums1:{1, 2}, nums2:{3, 4}" << endl;
    nums1 = {1, 2};
    nums2 = {3, 4};
    ret = findMedianSortedArrays(nums1, nums2);
    cout << "ret:" << ret << endl;
}

int main()
{
    test();
    return 0;
}