找回密码
 注册
关于网站域名变更的通知
查看: 152|回复: 0
打印 上一主题 下一主题

Python实现堆栈和队列详解

[复制链接]

该用户从未签到

跳转到指定楼层
1#
 楼主| 发表于 2023-11-3 19:04 | 只看该作者 回帖奖励 |倒序浏览 |阅读模式

EDA365欢迎您登录!

您需要 登录 才可以下载或查看,没有帐号?注册

x
python实现堆栈

堆栈是一个后进先出的数据结构,其工作方式就像一堆汽车排队进去一个死胡同里面,最先进去的一定是最后出来。

我们可以设置一个类,用列表来存放栈中元素的信息,利用列表的append()和pop()方法可以实现栈的出栈pop和入栈push的操作,list.append(obj)意思是向列表添加一个对象obj,list.pop(index=-1)意思是删除指定位置的对象,默认是最后一个对象,也就是说list.pop(),是删除列表中下标最大的元素。可先将Stack类写入文件stack.py,在其它程序文件中使用from stack import Stack,然后就可以使用堆栈了。

stack.py的程序:

代码如下:

& J* c* m! v* ~! E- ~- k! r

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

class Stack():  

    def __init__(self,size):  

        self.size=size

        self.stack=[]

        self.top=-1

    def push(self,ele):  #入栈之前检查栈是否已满  

        if self.isfull():  

            raise exception("out of range")

        else:  

            self.stack.append(ele)

            self.top=self.top+1

    def pop(self):             # 出栈之前检查栈是否为空  

        if self.isempty():  

            raise exception("stack is empty")

        else:  

            self.top=self.top-1

            return self.stack.pop()

      

    def isfull(self):  

        return self.top+1==self.size

    def isempty(self):  


; e# h; S8 S( y4 \. N

        return self.top==-1


6 B3 N% E3 f: R9 D

再写一个程序文件,stacktest.py 使用栈,内容如下:

代码如下:

1

2

3

4

5

6

7

#!/usr/bin/python

from stack import Stack

s=Stack(20)

for i in range(3):  

    s.push(i)

s.pop()


$ P8 e1 @5 i& t0 b, I) V) f

print s.isempty()

weibo.com/ttarticle/p/show?id=2309404963800309956654

weibo.com/ttarticle/p/show?id=2309404963800343511106

weibo.com/ttarticle/p/show?id=2309404963800368676885

weibo.com/ttarticle/p/show?id=2309404963800406425690

weibo.com/ttarticle/p/show?id=2309404963800439980172

weibo.com/ttarticle/p/show?id=2309404963800465145966

weibo.com/ttarticle/p/show?id=2309404963800485855281

weibo.com/ttarticle/p/show?id=2309404963800670666827

weibo.com/ttarticle/p/show?id=2309404963800725192722

weibo.com/ttarticle/p/show?id=2309404963800762941457

weibo.com/ttarticle/p/show?id=2309404963800809078882

weibo.com/ttarticle/p/show?id=2309404963800834244724

weibo.com/ttarticle/p/show?id=2309404963800855216133

weibo.com/ttarticle/p/show?id=2309404963800871993373

weibo.com/ttarticle/p/show?id=2309404963800892702727

weibo.com/ttarticle/p/show?id=2309404963800913936450

weibo.com/ttarticle/p/show?id=2309404963800934908008

weibo.com/ttarticle/p/show?id=2309404963800955617286

weibo.com/ttarticle/p/show?id=2309404963800985239578

weibo.com/ttarticle/p/show?id=2309404963801002016902

weibo.com/ttarticle/p/show?id=2309404963801052086305

weibo.com/ttarticle/p/show?id=2309404963801115000889

weibo.com/ttarticle/p/show?id=2309404963801157206086

weibo.com/ttarticle/p/show?id=2309404963801199149090

weibo.com/ttarticle/p/show?id=2309404963801232703534

weibo.com/ttarticle/p/show?id=2309404963801270452288

weibo.com/ttarticle/p/show?id=2309404963801291423986

weibo.com/ttarticle/p/show?id=2309404963801316589612

weibo.com/ttarticle/p/show?id=2309404963801337561139


% t- A) f) A3 ]  Z: A$ ~' r

weibo.com/ttarticle/p/show?id=2309404963801358532740

' }, Z* A8 q2 @; T4 f- w5 A

python 实现队列

队列是一种先进先出的数据类型,它的跟踪原理类似于在超市收银处排队,队列里的的第一个人首先接受服务,新的元素通过入队的方式添加到队列的末尾,而出队就是将队列的头元素删除。

   我们可以设置一个类,用列表来存放栈中元素的信息,利用列表的append()和pop()方法可以实现队列的入队enqueue和出队dequeue的操作,上面栈一个元素每次出去是列表的最后一个,直接用list.pop()出栈,而出队列每次是第一个,所以要用list.pop(0)出队列

weibo.com/ttarticle/p/show?id=2309404964059492516280

weibo.com/ttarticle/p/show?id=2309404964059530264962

weibo.com/ttarticle/p/show?id=2309404964059572207761

weibo.com/ttarticle/p/show?id=2309404964059601568094

weibo.com/ttarticle/p/show?id=2309404964059920334999

weibo.com/ttarticle/p/show?id=2309404964059958083663

weibo.com/ttarticle/p/show?id=2309404964060083913002

weibo.com/ttarticle/p/show?id=2309404964060100689944

weibo.com/ttarticle/p/show?id=2309404964060113272898

weibo.com/ttarticle/p/show?id=2309404964060126118163

weibo.com/ttarticle/p/show?id=2309404964060138438902

weibo.com/ttarticle/p/show?id=2309404964060256141751

weibo.com/ttarticle/p/show?id=2309404964060268724386

weibo.com/ttarticle/p/show?id=2309404964060281307659

weibo.com/ttarticle/p/show?id=2309404964060293890641

weibo.com/ttarticle/p/show?id=2309404964060306211240

weibo.com/ttarticle/p/show?id=2309404964060449079625

weibo.com/ttarticle/p/show?id=2309404964060461400185

weibo.com/ttarticle/p/show?id=2309404964060474245719

weibo.com/ttarticle/p/show?id=2309404964060486828643

weibo.com/ttarticle/p/show?id=2309404964060709126637

weibo.com/ttarticle/p/show?id=2309404964060725903771

weibo.com/ttarticle/p/show?id=2309404964060742418546

weibo.com/ttarticle/p/show?id=2309404964060755263588

weibo.com/ttarticle/p/show?id=2309404964060767584572

weibo.com/ttarticle/p/show?id=2309404964060872442015

weibo.com/ttarticle/p/show?id=2309404964060906258715

weibo.com/ttarticle/p/show?id=2309404964060931162556

weibo.com/ttarticle/p/show?id=2309404964060973367685


5 f0 K' J, B5 y! ?3 V

weibo.com/ttarticle/p/show?id=2309404964061002465341


% D2 D6 d- d" J) @2 P" G3 Q' _

代码如下:

1

2
, ]5 h6 N+ P6 H" [. j

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

class Queue():  

    def __init__(self,size):  

        self.size=size;

        self.front=-1;  

        self.rear=-1;  

        self.queue=[];

    def enqueue(self,ele):  #入队操作  

        if self.isfull():  

            raise exception("queue is full");

        else:  

            self.queue.append(ele)

            self.rear=self.rear+1

    def dequeue(self):      #出队操作  

        if self.isempty():  

            raise exception("queue is empty")

        else:  

            self.front=self.front+1

            return self.queue[self.front]

    def isfull(self):  

        return self.rear-self.front+1==self.size

    def isempty(self):  

        return self.front==self.rear

      

q=Queue(10);  

for i in range(3):  

    q.enqueue(i)

print q.dequeue()


8 w/ T& S1 k7 }" }1 ^

print q.isempty()


% E/ A, V/ V, Rweibo.com/ttarticle/p/show?id=2309404964043600298502- p7 V: J$ Q/ J; {$ A: U& W
weibo.com/ttarticle/p/show?id=2309404964043621270062
" q: D+ L3 A# {weibo.com/ttarticle/p/show?id=2309404964043638309435
: w8 \( Q+ G) Hweibo.com/ttarticle/p/show?id=2309404964043655086163
* X* ^$ w3 P0 e9 Vweibo.com/ttarticle/p/show?id=2309404964043713806364
+ r  I6 O4 k- }. v  s9 vweibo.com/ttarticle/p/show?id=2309404964043726389286
8 n) h3 U* q7 L/ a8 u' Bweibo.com/ttarticle/p/show?id=2309404964043738710164$ [7 Y: U  C0 o3 K5 H! T
weibo.com/ttarticle/p/show?id=2309404964043751293181  \9 A! v  s9 K3 l9 P1 _3 z0 f
weibo.com/ttarticle/p/show?id=2309404964043772526699
) |# i  F8 K6 L  @, u. s$ [weibo.com/ttarticle/p/show?id=2309404964043923259540  |) f- i, o( V' N: `
weibo.com/ttarticle/p/show?id=2309404964043935842359
! P; o) @  T( }9 Y: Y( J; n1 T% oweibo.com/ttarticle/p/show?id=2309404964043948687711
1 E- p0 X% R! V/ X1 t! g! oweibo.com/ttarticle/p/show?id=23094049640439652025631 S7 h% m5 J5 B* O/ K: K
weibo.com/ttarticle/p/show?id=2309404964043977785642/ r% s9 a/ }* I: c6 w0 j' G* @6 b/ l
weibo.com/ttarticle/p/show?id=2309404964044049088882% |& j3 q3 S1 {$ S) ?2 n' x
weibo.com/ttarticle/p/show?id=2309404964044196151334. w; U7 s% L5 s! d" g2 a# H
weibo.com/ttarticle/p/show?id=2309404964044275843559( G) I5 E7 h( a" n7 H3 p
weibo.com/ttarticle/p/show?id=23094049640444307706281 T5 q5 L$ O) _( C
weibo.com/ttarticle/p/show?id=2309404964044451741764( o3 w1 ~, O4 h
weibo.com/ttarticle/p/show?id=2309404964044464587419
0 W4 p* \' }$ e6 _$ wweibo.com/ttarticle/p/show?id=23094049640444855584957 q+ u7 z/ o$ U$ T
weibo.com/ttarticle/p/show?id=2309404964044497879732$ @& }8 ?# O) ^& V, b
weibo.com/ttarticle/p/show?id=2309404964044514656409
# c2 \; p  {& h1 r9 h9 [/ t3 iweibo.com/ttarticle/p/show?id=2309404964044535627823; q; H( E# @& e0 t
weibo.com/ttarticle/p/show?id=2309404964044552405070) ^( c  A* k/ E3 d; v5 Y! u
weibo.com/ttarticle/p/show?id=2309404964044569444484
4 ?! c4 Y1 b% }% r  t/ cweibo.com/ttarticle/p/show?id=2309404964044586222041
& c1 c* k1 Z6 iweibo.com/ttarticle/p/show?id=2309404964044611125576
: b3 S, G; j3 {* w0 ^weibo.com/ttarticle/p/show?id=2309404964044623970571
3 E& R+ M; |6 h7 e- A" Gweibo.com/ttarticle/p/show?id=2309404964044636553351
3 k9 F0 @9 y: d" L  j& T0 Qweibo.com/ttarticle/p/show?id=2309404964044648874040
8 ~! b, |) E: b! d: a/ uweibo.com/ttarticle/p/show?id=2309404964044657525363
8 b5 U$ C; p( h8 o2 `4 _9 lweibo.com/ttarticle/p/show?id=2309404964044674040074
2 [1 [  [4 V9 u; n, h5 W. ]% bweibo.com/ttarticle/p/show?id=2309404964044686623056
: ~$ U* P+ r6 j! r3 G+ |3 Pweibo.com/ttarticle/p/show?id=2309404964044699206002
( f7 r4 ^: K; _8 Y) f: c# q3 G7 Yweibo.com/ttarticle/p/show?id=2309404964044711788669
4 ~) K; u0 U, g% R: |. j: j: c/ w& [/ nweibo.com/ttarticle/p/show?id=2309404964044724371645
7 `. f6 Z) Z) x2 s, C& k4 T0 D% uweibo.com/ttarticle/p/show?id=2309404964044783354197
! P7 W/ e5 L3 l: p9 B8 s
! R" m! h+ k5 r* M0 e
" s9 e# T* i+ }, q  ?
2 k, r, ?9 O1 ?4 C2 r8 q
您需要登录后才可以回帖 登录 | 注册

本版积分规则

关闭

推荐内容上一条 /1 下一条

EDA365公众号

关于我们|手机版|EDA365电子论坛网 ( 粤ICP备18020198号-1 )

GMT+8, 2025-11-23 00:58 , Processed in 0.140625 second(s), 23 queries , Gzip On.

深圳市墨知创新科技有限公司

地址:深圳市南山区科技生态园2栋A座805 电话:19926409050

快速回复 返回顶部 返回列表