我使用VS code编辑运行,在windows中通过MSYS2使用g++运行C++代码; 我的代码在我的本地环境中对于相同的测试用例工作得很好,但我不知道为什么我会收到如下所列的运行时错误:
=================================================================
==31==ERROR: AddressSanitizer: heap-buffer-overflow on address 0x60200000015c at pc 0x000000346198 bp 0x7ffe413280b0 sp 0x7ffe413280a8
READ of size 4 at 0x60200000015c thread T0
#2 0x7f52446b90b2 (/lib/x86_64-linux-gnu/libc.so.6+0x270b2)
0x60200000015c is located 0 bytes to the right of 12-byte region [0x602000000150,0x60200000015c)
allocated by thread T0 here:
#5 0x7f52446b90b2 (/lib/x86_64-linux-gnu/libc.so.6+0x270b2)
Shadow bytes around the buggy address:
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 fd fa fa fa fd fa
0x0c047fff8010: fa fa fd fd fa fa fd fa fa fa fd fa fa fa fd fa
=>0x0c047fff8020: fa fa fd fa fa fa 00 00 fa fa 00[04]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
0x0c047fff8060: fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa fa
0x0c047fff8070: 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
Shadow gap: cc
==31==ABORTING
这是题目链接:合并排序数组 - Leetcode
我的答案如下:
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
vector<int> num1(m);
for(int i = 0; i < m; i++)
{
num1[i] = nums1[i];
}
int inum1 = 0, inum2 = 0,ires = 0;
for(int i = 0; i < m+n; i++)
{
if(num1[inum1]<=nums2[inum2])
{
nums1[i] = num1[inum1];
inum1++;
}
else
{
nums1[i] = nums2[inum2];
inum2++;
}
}
}
};
我需要知道我的代码中的错误,并知道为什么它在我的本地环境中运行良好,但在 LEETCODE 网站上显示相同测试用例的错误。