两个排好序的vector的中位数
There are two sorted arrays nums1 and nums2 of size m and n respectively.
Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).
You may assume nums1 and nums2 cannot be both empty.
Example 1:
nums1 = [1, 3] nums2 = [2] The median is 2.0
Example 2:
nums1 = [1, 2] nums2 = [3, 4] The median is (2 + 3)/2 = 2.5
C++版本代码。
double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
int m=nums1.size();
int n=nums2.size();
int med = (m+n)/2;
int ind=0;
int i=0;
int j=0;
vector<int> all;
while(ind<=med){
if(i>=m){
all.push_back(nums2[j]);j++;ind++;
}
else if(j>=n){
all.push_back(nums1[i]);i++;ind++;
}else{
int tmp = (nums1[i]>nums2[j])?nums2[j++]:nums1[i++];
all.push_back(tmp);ind++;
}
}
return ((m+n)%2==0)?(double)(all[ind-1]+all[ind-2])/2.0 : (double)all[ind-1];
}
一开始写的错误代码,如下,会报错
double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
int m=nums1.size();
int n=nums2.size();
int med = (m+n)/2;
int ind=0;
int i=0;
int j=0;
vector<int> all;
while(ind<=med){
while(((nums1[i]<=nums2[j]&&i<m)||j>=n)&&ind<=med){
all.push_back(nums1[i]);
i++;
ind++;
}
while(((nums1[i]>nums2[j]&&j<n)||i>=m)&&ind<=med){
all.push_back(nums2[j]);
j++;
ind++;
}
}
return ((m+n)%2==0)?(double)(all[ind-1]+all[ind-2])/2.0 : all[ind-1];
}
//leetcode 会超 但是自己的编译器是ok的
=================================================================
==29==ERROR: AddressSanitizer: heap-buffer-overflow on address 0x602000000074 at pc 0x00000040e7b4 bp 0x7ffe0696e000 sp 0x7ffe0696dff8
READ of size 4 at 0x602000000074 thread T0
#1 0x7f62f677c2e0 in __libc_start_main (/lib/x86_64-linux-gnu/libc.so.6+0x202e0)
0x602000000074 is located 0 bytes to the right of 4-byte region [0x602000000070,0x602000000074)
allocated by thread T0 here:
#0 0x7f62f81a1ce0 in operator new(unsigned long) (/usr/local/lib64/libasan.so.5+0xe9ce0)
#4 0x7f62f677c2e0 in __libc_start_main (/lib/x86_64-linux-gnu/libc.so.6+0x202e0)
Shadow bytes around the buggy address:
0x0c047fff7fb0: 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
0x0c047fff7fc0: 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
0x0c047fff7fd0: 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
0x0c047fff7fe0: 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
0x0c047fff7ff0: 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
=>0x0c047fff8000: fa fa fd fa fa fa fd fa fa fa 00 00 fa fa[04]fa
0x0c047fff8010: fa fa 04 fa fa fa fa fa fa fa fa fa fa fa fa fa
0x0c047fff8020: fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa
0x0c047fff8030: fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa
0x0c047fff8040: fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa
0x0c047fff8050: fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa
Shadow byte legend (one shadow byte represents 8 application bytes):
Addressable: 00
Partially addressable: 01 02 03 04 05 06 07
Heap left redzone: fa
Freed heap region: fd
Stack left redzone: f1
Stack mid redzone: f2
Stack right redzone: f3
Stack after return: f5
Stack use after scope: f8
Global redzone: f9
Global init order: f6
Poisoned by user: f7
Container overflow: fc
Array cookie: ac
Intra object redzone: bb
ASan internal: fe
Left alloca redzone: ca
Right alloca redzone: cb
==29==ABORTING