<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[wangya55的专栏]]></title><description><![CDATA[]]></description><link>https://blog.csdn.net/wangya55</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; wangya55]]></copyright><item><title><![CDATA[两个栈共用一个顺序存储空间的代码]]></title><link>https://blog.csdn.net/wangya55/article/details/2261735</link><guid>https://blog.csdn.net/wangya55/article/details/2261735</guid><author>wangya55</author><pubDate>Tue, 08 Apr 2008 22:23:00 +0800</pubDate><description><![CDATA[ #include#define STACK_INIT_SIZE 10//存储的初始分配struct Dblstack{ int *base1; int *base2; int *top1; int *top2; int stacksize;//当前分配的存储空间，以元素为单位};int Initstack(Dblstack &s){//构造一个空的顺序栈s s.base1=new int]]></description><category></category></item></channel></rss>