We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
if(n==1)
{
st+=str;
stk.push(st);
}
else if(n==1)
{
st.erase(st.size()-k);
stk.push(st);
}
else if(n==4)
{
stk.pop();
st=stk.top();
}
just reversing the order of changing the string and pushing it on stack is giving segmentation fault in last few cases..please explain
@adi7tya & @badal_bokaro
if u add st in stk before the while it will work correctlly (means adding empty string in stack)
or
u can add in case 4;;=======
else if(x==4) { s.pop(); if(s.empty()) st="";
else {st=s.top();}}
i think u will understood the reason of segma. fault
Simple Text Editor
You are viewing a single comment's thread. Return to all comments →
if(n==1) { st+=str; stk.push(st); } else if(n==1) { st.erase(st.size()-k); stk.push(st); } else if(n==4) { stk.pop(); st=stk.top(); } just reversing the order of changing the string and pushing it on stack is giving segmentation fault in last few cases..please explain
same seg fault for me too
@adi7tya & @badal_bokaro if u add st in stk before the while it will work correctlly (means adding empty string in stack) or u can add in case 4;;======= else if(x==4) { s.pop(); if(s.empty()) st=""; else {st=s.top();}}
i think u will understood the reason of segma. fault
you just saved my day