找回密码
 注册
关于网站域名变更的通知
查看: 150|回复: 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的程序:

代码如下:


7 Z$ K7 m* Q. f

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):  

) s5 ?4 t% `+ t# Y; u2 ~6 B% ~

        return self.top==-1


6 |) M8 a; l/ b4 G2 j" J; q; o

再写一个程序文件,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()


# f  a; A- X/ T

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


+ H6 F4 {% {0 {* q5 T  g) k+ \+ L

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


, d" b% i- }# y% x9 n8 u% I

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


8 j. p8 ?2 o8 I( e+ R. C+ `  q

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


" V- [; b3 O1 g/ w. H

代码如下:

1

2) L  y4 q* n) W8 }/ n. {

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()


4 k* q% f7 B" T  w# n+ r' L

print q.isempty()


" G; u5 J# Y% I: \. sweibo.com/ttarticle/p/show?id=23094049640436002985023 [6 E; k7 R7 `, W3 q7 ]  x4 O& b
weibo.com/ttarticle/p/show?id=2309404964043621270062) F" G5 d; A7 v  `* z  D9 v) `
weibo.com/ttarticle/p/show?id=2309404964043638309435" G  E# O' }, }  |; V
weibo.com/ttarticle/p/show?id=2309404964043655086163
7 V9 {% A5 h$ k! Cweibo.com/ttarticle/p/show?id=2309404964043713806364& y) o, Q$ d  V. z% G
weibo.com/ttarticle/p/show?id=2309404964043726389286
: @. o* R% C" v# k- k, c8 Yweibo.com/ttarticle/p/show?id=2309404964043738710164+ T5 O8 Z. a7 \1 r+ X. C7 e
weibo.com/ttarticle/p/show?id=2309404964043751293181
8 [* u  h4 K5 M- R" `7 cweibo.com/ttarticle/p/show?id=2309404964043772526699
! @3 [0 B8 G& B2 ]- w8 kweibo.com/ttarticle/p/show?id=2309404964043923259540
+ u7 l% q0 \; z. X4 cweibo.com/ttarticle/p/show?id=23094049640439358423590 S$ c# ?' n" m/ a7 M. ]
weibo.com/ttarticle/p/show?id=2309404964043948687711' f& T) ?+ j7 Z6 a
weibo.com/ttarticle/p/show?id=23094049640439652025638 E- h$ _! A; f% G
weibo.com/ttarticle/p/show?id=23094049640439777856422 o/ x3 K* s1 s! W( s$ _
weibo.com/ttarticle/p/show?id=2309404964044049088882
# u. i( _0 L& N* r/ f1 a4 ~weibo.com/ttarticle/p/show?id=2309404964044196151334  c& u5 u  `+ d* s) H% P
weibo.com/ttarticle/p/show?id=23094049640442758435597 r# l$ _5 \* Q+ [( k% V1 \! p
weibo.com/ttarticle/p/show?id=23094049640444307706282 ]" i+ U( ?# q4 h; @3 Z% D2 i
weibo.com/ttarticle/p/show?id=23094049640444517417643 O5 t- {$ E* |* @$ U
weibo.com/ttarticle/p/show?id=2309404964044464587419+ i4 ?& c, H0 {% i6 I* d
weibo.com/ttarticle/p/show?id=2309404964044485558495) G4 `6 j0 q- S7 ~. h
weibo.com/ttarticle/p/show?id=2309404964044497879732
# ^9 G3 ?( O/ @, a( W7 I1 Nweibo.com/ttarticle/p/show?id=2309404964044514656409
7 y# a; x! ^8 P9 ?) bweibo.com/ttarticle/p/show?id=2309404964044535627823
* m: d; Z1 ~* m# o/ Y. Oweibo.com/ttarticle/p/show?id=2309404964044552405070
) Z: H- R. M% j, l3 aweibo.com/ttarticle/p/show?id=2309404964044569444484' {) D4 j& F+ w7 P5 M' E
weibo.com/ttarticle/p/show?id=23094049640445862220415 t3 b0 r) T" t+ |
weibo.com/ttarticle/p/show?id=2309404964044611125576
; ]5 g' B; N4 |! sweibo.com/ttarticle/p/show?id=2309404964044623970571
5 C9 V, H  C7 ]! Mweibo.com/ttarticle/p/show?id=2309404964044636553351
# T# b; g7 _+ wweibo.com/ttarticle/p/show?id=2309404964044648874040
- E0 \2 F* c/ j" k! Eweibo.com/ttarticle/p/show?id=2309404964044657525363
" x; G3 P% g# |) \; S) L9 Zweibo.com/ttarticle/p/show?id=2309404964044674040074
+ H( ~3 t+ [* g  p: iweibo.com/ttarticle/p/show?id=2309404964044686623056
& R+ K& I$ ?2 H# a% c( N: q& |weibo.com/ttarticle/p/show?id=23094049640446992060024 n3 @0 f4 a7 d
weibo.com/ttarticle/p/show?id=2309404964044711788669
4 M: ~: r7 G6 G  I: ^2 s' \weibo.com/ttarticle/p/show?id=2309404964044724371645
# m* g9 Z9 d3 v6 I: t  h9 o- xweibo.com/ttarticle/p/show?id=2309404964044783354197
' I9 B7 O% f+ D, u9 X2 w) d0 C3 R- }
+ Y' J# S  t6 u% u/ E- a/ X
8 D" u" X( {" T  f: ~' `& f1 a8 o1 W
您需要登录后才可以回帖 登录 | 注册

本版积分规则

关闭

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

EDA365公众号

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

GMT+8, 2025-11-22 09:27 , Processed in 0.140625 second(s), 22 queries , Gzip On.

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

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

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