📄 text3-23.htm
字号:
<html>
<head>
<title>Untitled Document</title>
<meta http-equiv="Content-Type" content="text/html; charset=gb2312">
</head>
<body bgcolor="#FFFFFF" link="#0000FF" vlink="#3399FF" alink="#FF0066">
<div id="Layer1" style="position:absolute; width:711px; height:21px; z-index:1; top: 10px; background-color: #CCCCCC; layer-background-color: #CCCCCC; border: 1px none #000000; left: 26px"><b>|</b><font face="宋体" size="2"><a href="../text1/text1-0.htm">第一章</a></font><b>|</b><font face="宋体" size="2"><a href="../text2/text2-0.htm">第二章</a></font><b>|</b><font face="宋体" size="2">第三章</font><b>|</b><font face="宋体" size="2"><a href="../text4/text4-0.htm">第四章</a></font><b>|</b><font face="宋体" size="2"><a href="../text5/text5-0.htm">第五章</a></font><b>|</b><font face="宋体" size="2"><a href="../text6/text6-0.htm">第六章</a></font><b>|</b><font face="宋体" size="2"><a href="../text7/text7-0.htm">第七章</a></font><b>|</b><font face="宋体" size="2"><a href="../text8/text8-0.htm">第八章</a></font><b>|</b><font face="宋体" size="2"><a href="../text9/text9-0.htm">第九章</a></font><b>|</b><font face="宋体" size="2"><a href="../text10/text10-0.htm">第十章</a></font><b>|</b><font size="2" face="宋体"><a href="../textA/textA-0.htm">算法分析</a><b><font color="#000000">|</font></b>
</font></div>
<pre align="left">
</pre>
<pre align="left">
<font face="Arial, Helvetica, sans-serif" size="5" color="#FF0033"><b>3.5 Multiple Stacks and Queues
</b></font><b><font face="Arial, Helvetica, sans-serif" size="4" color="#000000">#define MEMORY_SIZE 100 <i><font size="3" color="#FF0099"> /* size of memory */</font></i>
#define MAX_STACKS 10 <i><font size="3" color="#FF0099"> /* max number of stacks plus 1*/</font></i>
<i><font size="3" color="#FF0099">/* global memory declaration */</font></i>
element memory [ MEMORY_SIZE ];
int top [ MAX_STACKS ];
int boundary [ MAX_STACKS ];
int n ; <i><font size="3" color="#FF0099"> /* number of stacks entered by the user */</font></i>
<img src="image/mulstack.gif" width="570" height="109" hspace="80">
<font color="#ff0033"> All stacks are empty and divided into roughly equal segments
</font>
top [ 0] = boundary [ 0] = -1;
for ( i = 1; i < n; i ++ )
top [ i ] = boundary [ i ] = (MEMORY_SIZE / n ) * i;
boudary [n ] = MEMORY_SIZE -1;
</font></b></pre>
<table width="731" cellspacing="0" cellpadding="0">
<tr>
<td width="327"> </td>
<td width="271"><a href="../index.htm"><img width="60" height="25" usemap="#MapMap4" border="0" src="../../images/home.gif"></a><a href="../index.htm"><map name="MapMap4"><area shape="rect" coords="42,-34,88,-15" href="text0.htm"><area shape="rect" coords="4,4,55,23" href="text3-index.htm"></map></a></td>
<td width="131"><font face="楷体_GB2312" size="2"><b><a href="text3-22.htm">上一页</a>
<a href="text3-24.htm">下一页</a> </b></font></td>
</tr>
</table>
</body>
</html>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -