程序出現(xiàn)運(yùn)行時(shí)錯(cuò)誤
問(wèn)題描述
#include <algorithm>#include <iostream>#include <cmath>#include <vector>using namespace std;int countPrimes(int n) { if (n <= 2)return 0; vector<int> arr(n, 0); for (int i = 2; i <= sqrt(n); ++i) {if (!arr[i]) for (int j = i * i; j <= n; j += i) {arr[j] = 1; } } cout << arr[2] << endl; int j = 0; for (int i = 2; i <= n; ++i) {if (!arr[i]){ arr[j++] = i;} } cout << "j" << j << endl; int l = 0, r = j - 1; while (l <= r) {int m = (l + r) >> 1;cout << m << endl;cout << "arr[m]" << arr[m] << "n - 1" << n - 1 << endl;if (arr[m] == n - 1){ l = r = m; return l + 1;}else if (arr[m] < n - 1){ l = m + 1;}else r = m - 1;cout << "l = " << l << "r= " << r << endl;cout << "m=" << m << endl; } cout << l << endl; return 0;}int main(){ cout << countPrimes(6) << endl; return 0;}
在程序中加斷點(diǎn),發(fā)現(xiàn)運(yùn)行到return l + 1處時(shí)報(bào)錯(cuò),報(bào)錯(cuò)信息如下
在VSCODE中還會(huì)彈出一個(gè)窗口,提示源 源未知 不可用
請(qǐng)問(wèn)問(wèn)題出在哪里了?謝謝了
問(wèn)題解答
回答1:通常win平臺(tái)非預(yù)期的sigtrap都是heap corruption。再看你的代碼,第十六行arr[j] = 1; 明顯有invalid write。所以vector arr(n, 0);的n應(yīng)該改大一點(diǎn),比如n+1。
相關(guān)文章:
1. python3.x - python連oanda的模擬交易api獲取json問(wèn)題第五問(wèn)2. docker - 如何修改運(yùn)行中容器的配置3. nignx - docker內(nèi)nginx 80端口被占用4. docker-machine添加一個(gè)已有的docker主機(jī)問(wèn)題5. java - SSH框架中寫分頁(yè)時(shí)service層中不能注入分頁(yè)類6. 關(guān)于docker下的nginx壓力測(cè)試7. 為什么我ping不通我的docker容器呢???8. node.js - 我是一個(gè)做前端的,求教如何學(xué)習(xí)vue,node等js引擎?9. javascript - js代碼獲取驗(yàn)證碼倒計(jì)時(shí)問(wèn)題10. html5 - 百度echart官網(wǎng)下載的地圖json數(shù)據(jù)亂碼
