栈与队列修改稿.pptVIP

栈和队列;一、栈的概念和特性;一、栈的概念和特性;练习4.1;练习4.2;练习4.3;二、栈的存储结构;三、栈的主要运算;三、栈的主要运算;三、栈的主要运算;三、栈的主要运算;四、栈的应用;程序;begin Readln(m,r); top:=0; While m0 do Begin push(m mod r); m:=m div r; End; While(not sempty(stack) ) do write(pop); end.;四、栈的应用;例4. 1：程序员输入问题;例4. 1：程序员输入问题;例4. 1：程序员输入问题;例4. 1：程序员输入问题; begin{主程序} … while not eof do begin setnull(s);　　　 while not eoln do begin read(ch); case ch of ‘#’:pop(s); ‘@’:setnull(s) else push(s,ch) end; end; for i:=1 to top do write(s[i]); writeln; readln; end ; end.;例4.2后缀表达式计算;请你试一试;;例4.3表达式计算——后缀表达式计算;procedure readdata(var a:arr); var i,k:integer; begin assign(input,count.in);reset(input); read(ch);i:=0; while ch‘# do begin i:=i+1;a[i]:=ch; read(ch); end; i:=i+1; a[i]:=‘#;close(input); end;;function comp(a:arr; var s:arr1):real; var i,k:integer; begin i:=1; top:=0; ch:=a[i]; while ch‘# do begin case ch of 0..9:begin x:=0; while (ch ) do begin x:=x*10+ord(ch)-ord(0); i:=i+1; ch:=a[i]; end; top:=top+1; end;; +:begin x:=s[top-1]+s[top];dec(top); end; -:begin x:=s[top-1]-s[top]; dec(top); end; *:begin x:=s[top-1]*s[top]; dec(top); end; /:begin if s[top]0 then begin x:=s[top-1]/s[top];dec(top); end else begin writeln(‘error’); close(output); halt; end; end; end ; {case} s[top]:=x;i:=i+1;ch:=a[i]; end ;{while} comp:=trunc(s[top]*1000+0.5)/1000; end;{function};begin assign(output,count.out); rewrite(output); for i:=1 to n do s[i]:=0; readdata(a); t:=comp(a,s); writeln(t=,t:0:2);