leetcode报错：reference binding to misaligned address 0xbebebebebebec0ba for type ‘int‘, which requir 4

2024-05-11 17:48:37

leetcode，剑指offer 31题报错：

Line 170: Char 16: runtime error: reference binding to misaligned address 0xbebebebebebec0ba for type 'int', which requires 4 byte alignment (stl_deque.h) 0xbebebebebebec0ba: note: pointer points here <memory cannot be printed> SUMMARY: UndefinedBehaviorSanitizer: undefined-behavior /usr/bin/../lib/gcc/x86_64-linux-gnu/9/../../../../include/c++/9/bits/stl_deque.h:180:16

代码：

class Solution {
public:bool validateStackSequences(vector<int>& pushed, vector<int>& popped) {stack<int> stk;int i = 1, j = 0, n = pushed.size();// if(n == 0)if(n == 0 || (n == 1 && pushed[0] == popped[0])){return true;}stk.push(pushed[0]);while(i < n){while(i<n && stk.top() != popped[j]){stk.push(pushed[i]);++i;}while(!stk.empty() && stk.top() == popped[j]){stk.pop();j++;}}return stk.empty();}
};

原因：

网上查是数组越界问题，经检查程序验证：

为非法访问地址，不只是数组越界。本程序报错原因为：

栈stack<int> stk;为空时访问了stk.top()。

解决办法：

stk.top()前加一个栈空判断即可，即stk.empty() && stk.top();

改正后代码：

class Solution {
public:bool validateStackSequences(vector<int>& pushed, vector<int>& popped) {stack<int> stk;int i = 1, j = 0, n = pushed.size();if(n == 0 || (n == 1 && pushed[0] == popped[0])){return true;}stk.push(pushed[0]);while(i < n){while(i < n && (stk.empty() || stk.top() != popped[j])){stk.push(pushed[i]);++i;}while(!stk.empty() && stk.top() == popped[j]){stk.pop();j++;}}return stk.empty();}
};

leetcode报错：reference binding to misaligned address 0xbebebebebebec0ba for type ‘int‘, which requir 4相关推荐

leetcode报错：member access within null pointer of type struct ListNode
leetcode报错:member access within null pointer of type 'struct ListNode'
LeetCode 报错AddressSanitizer: SEGV on unknown address 0x000000619d20 (pc 0x000000401a6a bp 0x7ffd35b3
LeetCode90子集 II 题目描述: 给定一个可能包含重复元素的整数数组 nums,返回该数组所有可能的子集(幂集). 说明:解集不能包含重复的子集. 示例: 输入: [1,2,2] 输出: [ ...
【leetcode报错】AddressSanitizer: heap-buffer-overflow on address 0x6020000000a0 at pc 0x00000034b4d9 bp
原题是力扣第一道题[两数之和] 我的解题代码,报错了,解决方案写在注释里了: class Solution {public:vector<int> twoSum(vector<int ...
力扣报错runtime error: load of null pointer of type ‘int‘解决思路
记录本算法小白刷力扣的这道题遇到的报错 349. 两个数组的交集https://leetcode.cn/problems/intersection-of-two-arrays/ 出现报错的代码 /** ...
LeetCode 报错AddressSanitizer: SEGV on unknown address (pc 0x0000003445e3 bp 0x7ffdb86b99e0 sp 0x7ffdb
这种错误就是数组越界了. 我这里例子里即使递归结束了,没有直接return,结果计算row和col的时候就越界了.,要把return :取消注释
leetcode报错runtime error: reference binding to null pointer of type ‘std::vector＜std::__cxx11::basic_
leetcode报错:runtime error: reference binding to null pointer of type 'std::vector<std::__cxx11::ba ...
LeetCode报错：Line 923: Char 9: runtime error: reference binding to null pointer of type ‘std::__cxx11:
LeetCode报错报错原因: Line 923: Char 9: runtime error: reference binding to null pointer of type 'std::__ ...
LeetCode 报错解决 heap-buffer-overflow Heap-use-after-free Stack-buffer-overflow Global-buffer-overflow
文章目录前言 Heap-buffer-overflow Heap-use-after-free Stack-buffer-overflow Global-buffer-overflow 前言在做L ...
nginx 报错 99: Cannot assign requested address
为什么80%的码农都做不了架构师?>>> nginx 报错 99: Cannot assign requested address net.ipv4.ip_local_port ...

最新文章

热门文章