From 8a691960a2859632e600ef0b3106edf6c684ac6d Mon Sep 17 00:00:00 2001
From: fu08 <1007702646@qq.com>
Date: Tue, 17 Nov 2020 23:19:15 +0800
Subject: [PATCH] Complete HomeWork

---
 .../ArrayQueue.class"                         | Bin 0 -> 945 bytes
 .../ArrayStack.class"                         | Bin 0 -> 1655 bytes
 .../ArrayStack.java"                          |  57 +++++++++++++
 .../LinkedStack.class"                        | Bin 0 -> 878 bytes
 .../LinkedStack.java"                         |  59 ++++++++++++++
 .../Node.class"                               | Bin 0 -> 282 bytes
 .../QueueLinked.class"                        | Bin 0 -> 1095 bytes
 .../QueueLinked.java"                         |  67 +++++++++++++++
 .../QueueNode.class"                          | Bin 0 -> 468 bytes
 .../QueueTest.class"                          | Bin 0 -> 649 bytes
 .../QueueTest.java"                           |  76 ++++++++++++++++++
 11 files changed, 259 insertions(+)
 create mode 100644 "\350\257\276\345\220\216\344\275\234\344\270\232/ArrayQueue.class"
 create mode 100644 "\350\257\276\345\220\216\344\275\234\344\270\232/ArrayStack.class"
 create mode 100644 "\350\257\276\345\220\216\344\275\234\344\270\232/ArrayStack.java"
 create mode 100644 "\350\257\276\345\220\216\344\275\234\344\270\232/LinkedStack.class"
 create mode 100644 "\350\257\276\345\220\216\344\275\234\344\270\232/LinkedStack.java"
 create mode 100644 "\350\257\276\345\220\216\344\275\234\344\270\232/Node.class"
 create mode 100644 "\350\257\276\345\220\216\344\275\234\344\270\232/QueueLinked.class"
 create mode 100644 "\350\257\276\345\220\216\344\275\234\344\270\232/QueueLinked.java"
 create mode 100644 "\350\257\276\345\220\216\344\275\234\344\270\232/QueueNode.class"
 create mode 100644 "\350\257\276\345\220\216\344\275\234\344\270\232/QueueTest.class"
 create mode 100644 "\350\257\276\345\220\216\344\275\234\344\270\232/QueueTest.java"

diff --git "a/\350\257\276\345\220\216\344\275\234\344\270\232/ArrayQueue.class" "b/\350\257\276\345\220\216\344\275\234\344\270\232/ArrayQueue.class"
new file mode 100644
index 0000000000000000000000000000000000000000..d54280d8ac513ae6a17e029c482d308af2745b3d
GIT binary patch
literal 945
zcmZ`$O-~b16g_Wd+9|^TrF<zUVo_{Ipe{5lG^jD4D2f6h0XGcgNe0?!Go2Fo2mS+f
zrLK&L8x4p7gL{96X#5k#^QPq^F>LOA_v_qq?)&j~XAi(t<Sf`Y-+)G>mFZXJf<<%D
z#6SX<EX0vfaW(<R#AOqM0&zD8Cj3x9dpaQydlr;bAow-{=>}}L;rU)T$~ZHTouj)`
zT9yJWlb$ahRf|h9n01#5%$QzftXK{=1oTXHL7-_Sbn|Nu-EzGi_bTJnLV<{$Uy%W~
zG?b-W8?SBT40k3}X1caFkj2tEajltBHOR|xPc3PFQk7LXD=Xpfs=MymNMXoE6Pj(b
zAZepjnbYVJ=vMVy!Sz>i(^Wt8igN6EUY0|z<O|q;UcK3W@p6Cr^RL}^3S`(ur<$r4
zetzBg{b7f@ZwG<95$zO69wAOGt;#$VkTp-zk(oRy&4hvHuUya0p^vAw`7=5+#gH#e
zk&HZf(wh+6-A3EaXq0u0zSG%;aC*L3ThJVR3%a9i!T7`qSE)K;v~4gr)yPbenGSTZ
zN(ptWYeW+4N;#XH--NdJ7N+qYhW?RREy9UM9lbckOblA`7XMw{j#kkbsYA3!<Hj<b
zaT3VD0Z1wW=|0r-m@Jj1e&-8fuhF!N_<YLTM&i3db>@j_EG|%9&y*5aBbMS2Fv#-^
z@k4V+<4T0DL$s1y56;vnrt1`~2#iXHmAcxMYU)N9ojtMN_^<ya`+E=jAMh^fifOWM
kIACubXRj|9i~OMor$)Y+{|($F`FkXP|2Xk;ENJNa2Y5o5%m4rY

literal 0
HcmV?d00001

diff --git "a/\350\257\276\345\220\216\344\275\234\344\270\232/ArrayStack.class" "b/\350\257\276\345\220\216\344\275\234\344\270\232/ArrayStack.class"
new file mode 100644
index 0000000000000000000000000000000000000000..a5357d559bb6583ec25cb1966668b801f353af90
GIT binary patch
literal 1655
zcmZ`&-%nd*7=FIfAE&JcC{Wk{nH&BXw4=3*F%_JH35s?w?VJv8JhW%*%+faP>CC*=
z#0!%p#+zk{nTg9{;)N`uEZ~oO{{?S_?aq6%IG^|QFj^LG-nad}_j{iAdEWQ@@$cqu
z0LJlA1b(E$h+#~^aUJ85Ped3d!Z?XnLU=WT*Dx8u6keC(Qz5*e<8%aVNQW>jc}Bt+
z32#d6td2RUOiOr6!rKZyr&Lx@^9rGySvGUFb4?*&Rw^cQ_s5wl=2bIQFpDdx#pNqj
z&Y4sQPT57<ImNfbBNr6>XG(cXp(A4#t%cg^vQ;^6E*E&B+tu0Cvf#0BNue$4n7L2S
znq}`kXjkWIg#r=Ewd!Ssp5dq2guqvp7GuLBPhZm)KCjxJla3@*p;s@LKAUz?S53R9
z&^z2LBI{J_;>x7JMzW<^C1=gq(rd@GD0Ul6iev+WIAq`;`V91=Pa(SB2m=Fn*1!uG
z(lKw~9lWbBuygCH?Txz+wyy7NegF3_U+-N1X8X(A+dr&5ymwni#=u!D=vXvx4(}N_
zf+5P{lfUk7KKOBy^$&mlcKhacqiKZ$dvuMKXKHpKZ&f&|!v@|*R>FA$AK-$453xWw
zdkPG^h?fi;!=aYGv)8JQwMwH(HHU6D+_X!nbF{=Ei)F5Iy4@~w>oILDOHqM-woIwX
z&d$A#=ZlWDBE9NY%|gvuyd+bYZyujlA<JZz%T_V3Fxou*UEHRLx7fgkE%n}RHdE}c
z4>_gA(f(EPxVZJMMvf)Mj}P!cllk+PCM)1(j+{9RCF{ZX9RJPmUNQH_H=yF$I<$Cb
z9lm({9(=#TzmC8fZxs$R_9DO-AbyZ2I@%E;vfyzUJiN4r*G>RUy9M2U2Y%mAe5bh>
zL6^<I^DdHRoaRo*8hXzs*toRQEzhL~fBye4qPrNKE(Vvz!^pBhjTl4mI)XP~+=bp1
zsw2Ecyg>XSf&HH>QD`D7(i&|wq{S$z2OSg|rFlmvPTFKgQ9>WZut#u-9tgoP-+e?f
zWO?QWqQYX3MRU(~nU?%{GL2;tKR==Br+eTe0-S=uIm9@JK9a?0g3yJa9-&Xi2-yxk
z;T$5P7!z?tP{WuYHs;dsROH8zV3fHIGE03xj1>EuOXK{<?~74NP0z2SluixY#8GP5
zLfgd+w0CvX5f#dTu{t{I=&Gap3-$QU<3IPj>v9(^$wf%fq$Ea>c7=qYJwibJ!^1ES
ylOEkHm56(TTZoaOCzJ5gvO0Pb0Wa5aVE@t`r!C{0$_ZLBLGw-$EJY9vFaHOLLq%Tz

literal 0
HcmV?d00001

diff --git "a/\350\257\276\345\220\216\344\275\234\344\270\232/ArrayStack.java" "b/\350\257\276\345\220\216\344\275\234\344\270\232/ArrayStack.java"
new file mode 100644
index 0000000..22e5ca5
--- /dev/null
+++ "b/\350\257\276\345\220\216\344\275\234\344\270\232/ArrayStack.java"
@@ -0,0 +1,57 @@
+//用数组实现栈
+public class ArrayStack {
+	private int top;
+	private int capacity;
+	private Object [] array;
+	public ArrayStack(){
+		top=-1;//栈顶指针为-1
+		capacity=5;//初始化容量的大小
+		array=new Object[capacity];//初始化数组
+	}
+	
+	public boolean isEmpty(){//判断是否为空
+		return top==-1;
+	}
+	
+	public boolean isFull(){//判断是否是满栈的
+		return top==capacity-1;
+	}
+	
+	public void push(Object data){//入栈操作
+		if(isFull()){
+			System.out.println("栈已经满，插入失败");
+			return;
+		}
+		array[++top]=data;
+	}
+	
+	public Object pop(){//返回栈顶元素，并且删除
+		Object data=0;
+		 if(isEmpty()){
+			 System.out.println("栈为空，返回-1");
+			 data=-1;
+		 }
+		 data=array[top--];
+		 return data;
+	}
+	
+	public Object top(){//返回栈顶元素，但是不删除
+		return array[top];
+	}
+	
+	public int size(){//返回栈顶元素，但是不删除
+		return top;
+	}
+	
+	public void showAll(){//显示栈中所有的值 
+		for(int i=top;i>=0;i--){
+			System.out.print(" "+array[i]);
+		}
+	}
+	public static void main(String[] args) {
+		ArrayStack stack=new ArrayStack();
+		stack.push(1);
+		stack.push(2);
+		stack.showAll();
+	}
+}
\ No newline at end of file
diff --git "a/\350\257\276\345\220\216\344\275\234\344\270\232/LinkedStack.class" "b/\350\257\276\345\220\216\344\275\234\344\270\232/LinkedStack.class"
new file mode 100644
index 0000000000000000000000000000000000000000..d56e8060a2fea5da789c0217f29f595fd9825ba7
GIT binary patch
literal 878
zcmZXS&2JJ>6vfXQ=A+CE{Xk1CP+N*cn8A|Rs%bQCOiW0ac2Q$==Kzxyia=UuT>9U1
z<Dw=tB$~J^iT{m>OQN1POl=bbdGF4>@15U0cjm|MuipV|qh!KFHjX$}4BRyl!>Y-L
zwK$`kT-N1d-oQNr8v^QK;5P;I+HS8IJZ12#)ol%)3&e`0*DSwaT41i$>IS>R_x0fT
zm0#~LqxOd<hun%)c`UI%@Eb>--;b)sK`^NKCj)`m;#9db-PjVP`@Mb$s0vuo$?0ix
zzc)N?1TR|>F;D1G&<v$F+y1F<BY{~P7HooLzcP`uaT|*^3b1Y5N72SI7O8vVGNt78
zO2_XWRQBrapuxt}Zt#JdcItPAgo!G0oQugB3Mi7nNMlSS*Ev2Fm>1klX9VGhFHk;*
zr{`skHDCrRH3SxrjPA6ViLtWnTtFEk>3l=%ZDs_Ox6iQV$n*%BSH8~c<qPOk*QL4w
zsh)<;)rP@tQtV}wS(lV8+~N;pD5)&Zau5;s4R^`Sx?^bKTw*+zx|gt|ym$8JSNWXv
zoBAp0ERnQK_h~xFa9s)Y`4#CCs0LDU7E8DjQ9km%r0h)HY09T7Lp7NpXpBTSDYA{L
z;*3|8_QKS^77833uuhA4MjONzkmdW#p~%QZ1rPXfZ-(u}p~NT1vK{jIwxe#|MV|BS
wB}{2HwC;M+F#p%qfBt9vAuVrlxQ{s8$CP|R?oP<Epju)ALD&NI(_zDzznX!C6#xJL

literal 0
HcmV?d00001

diff --git "a/\350\257\276\345\220\216\344\275\234\344\270\232/LinkedStack.java" "b/\350\257\276\345\220\216\344\275\234\344\270\232/LinkedStack.java"
new file mode 100644
index 0000000..83b4e8a
--- /dev/null
+++ "b/\350\257\276\345\220\216\344\275\234\344\270\232/LinkedStack.java"
@@ -0,0 +1,59 @@
+class Node {
+    int value;
+    Node next = null;
+    Node(int value) {
+        this.value = value;
+    }
+}
+public class LinkedStack {
+    private Node head = null;//链表
+    //进栈
+    public void push(int element) {
+        if(head == null) {
+            head = new Node(element);
+        }else{
+            Node last = getLast(head);
+            last.next = new Node(element);
+            last.next.next = null;
+        }
+    }
+
+    private Node getLast(Node node) {
+        if(node == null) {
+            return null;
+        }
+        Node last = head;
+        while(node.next != null) {
+            last = last.next;
+        }
+        return last;
+    }
+
+    //出栈
+    public int pop() {
+        if(head == null) {
+            return -1;
+        }
+        Node last = getLast(head);
+        if(head.next == null) {
+            head = null;
+            return last.value;
+        }
+
+        Node lastlast = getLastLast(head);
+
+        lastlast.next = null;
+        return last.value;
+    }
+
+    private Node getLastLast(Node head) {
+        if(head == null || head.next == null) {
+            return null;
+        }
+        Node lastLast = head;
+        while (lastLast.next.next != null) {
+            lastLast = lastLast.next;
+        }
+        return lastLast;
+    }
+}
diff --git "a/\350\257\276\345\220\216\344\275\234\344\270\232/Node.class" "b/\350\257\276\345\220\216\344\275\234\344\270\232/Node.class"
new file mode 100644
index 0000000000000000000000000000000000000000..56a7f823c0ffbc00aa993d132f9729f2230ef422
GIT binary patch
literal 282
zcmW+wF>b;@5S+y}4vvF~6Vjxi1Q(%z4n%{5gk+I|i2iI&k-;$%vQfT8fsj)003H=F
zM=`T|JF|0p{r|fF7~;)?gH{7Jo(+XAUR=BioP)|MEs(juF7$6HsK<-lT94R_vmz@e
z6uR@?ie<{VAc(U<FRGtJ@4r-%bK)&`)jrj;%sg6@w|c!SRl5DysDtw1q3z=V4Ig#5
z%rW^i8nK_N;=BKuY;?-6t!{6H4)1e#bd8{&46{rY!owr0&u&16@dVKs63Gd*==}ui
WcsD+gLk5AcVR79-lW{^e(ZLPs0xVSk

literal 0
HcmV?d00001

diff --git "a/\350\257\276\345\220\216\344\275\234\344\270\232/QueueLinked.class" "b/\350\257\276\345\220\216\344\275\234\344\270\232/QueueLinked.class"
new file mode 100644
index 0000000000000000000000000000000000000000..688aa20203ba9b4682da0ac871b58a04e1f66878
GIT binary patch
literal 1095
zcmZWnOHUI~7(KTwOk0MB<)u7|JPM_QEpLHB320mu)YO;|R|6eMfljebjV3OPaib=z
zj5`zKLYAVTK)|?^#NUDF${%3j<J_UVbTQw(_xsLwzjMx=FTb}x0qDoL7e2Ik;6^}(
zb_E??xDfO(bjlD?pm|wobE8YH7u*QD5pkp2gC6wCRG*g@4Ja5CD7u}^n3h0E{CdvF
z8Pl1h5fyM{4LvJRJeo37R!qPd?7YeBB~}H><0;da&ZTFK><xW(i5bN(@5pX}>R^09
zzo$o*baOs(b#}p+v!b%KG-2s;i&OgYVMo#^bW{a9|8L=}w4O2rYJ#^;R1;P<WzO?L
zN)+%WGP&%WaU~@wRM_;%Y|%)DB?T2Vs8vyoDixKe67U=el%;wV7iDP(!xVp_nX12j
ze7(2zR7D-?dD?%qvj6fOH{bL5z3ms=d|P?GxAjQDh>9piRW!n{U`$0!;w%2uPc5c#
zpBB54x}^*FP6#SEbgC=y;I3t)>3Jr{rs@N9DigUz?G_y{^fX_n(jId<&4*Z)pd}N{
zd}Sa17Y9G8XN0tZ(FMASTE??H^${VsmWMVWLLv``49@pV37li}u>pj;2=_2kMpuM%
zrf|VSR-8mkhSuTOMKc%YF6u%%aLs6&D3UkI5-(jv(_wZ>rn>SdwrlGsCQQzB*faf5
zxNqbvKPNRIKsjNwU=XdC;HiOC7aRe}f!-IGJY%<%d-;Gukyw)(Ip{6?a`}u}nTa3E
z)YhTcD6Vly#c5M<YHLSaLhy1QA|s9Z!_*zYd32LS53{{I_47v>z$DofczFUuHW77T
z@nf=*4h`+VJ+lc<T=RK1P@?%%JC@q9jL|vPpu9ol2b60YsMx@nCl0at=f|-x?YtKl
q=F^VQn<$@il>UryQVbm!C!-j-OxQeBIDVl;L9_TtoS=Ks-PXUd$kA&6

literal 0
HcmV?d00001

diff --git "a/\350\257\276\345\220\216\344\275\234\344\270\232/QueueLinked.java" "b/\350\257\276\345\220\216\344\275\234\344\270\232/QueueLinked.java"
new file mode 100644
index 0000000..23cbb42
--- /dev/null
+++ "b/\350\257\276\345\220\216\344\275\234\344\270\232/QueueLinked.java"
@@ -0,0 +1,67 @@
+//用链表实现队列
+class QueueNode {  
+    Object data; // 节点存储的数据  
+    QueueNode next; // 指向下个节点的指针  
+ 
+    public QueueNode() {  
+       this(null, null);  
+    }  
+ 
+    public QueueNode(Object data) {  
+       this(data, null);  
+    }  
+ 
+    public QueueNode(Object data, QueueNode next) {  
+       this.data = data;  
+       this.next = next;  
+    }  
+}  
+
+public class QueueLinked {  
+    QueueNode front; // 队首指针  
+    QueueNode rear;  // 队尾指针  
+ 
+    public QueueLinked() {  
+       this.rear = null;  
+       this.front = null;  
+   }   //将一个对象追加到队列的尾部
+    public void enqueue(Object obj) {  
+       //如果队列是空的  
+       if (rear == null && front == null) {  
+           rear = new QueueNode(obj);  
+           front = rear;  
+       } else {  
+           QueueNode node = new QueueNode(obj);  
+           rear.next = node;  
+           rear = rear.next;  
+       }  
+   }    
+    //队首对象出队
+    //return 出队的对象，队列空时返回null     
+    public Object dequeue() {  
+       //如果队列空  
+       if (front == null) {  
+           return null;  
+       }  
+       //如果队列中只剩下一个对象  
+       if (front == rear && rear != null) {  
+           QueueNode node = front;  
+           rear = null;  
+           front = null;  
+           return node.data;  
+       }  
+       Object obj = front.data;  
+       front = front.next;  
+       return obj;  
+   }   
+    public static void main(String[] args) {  
+       QueueLinked q = new QueueLinked();  
+       q.enqueue("张三");  
+       q.enqueue("李斯");  
+       q.enqueue("赵五");  
+       q.enqueue("王一");  
+       for (int i = 0; i < 4; i++) {  
+           System.out.println(q.dequeue());  
+       }  
+    }  
+}
\ No newline at end of file
diff --git "a/\350\257\276\345\220\216\344\275\234\344\270\232/QueueNode.class" "b/\350\257\276\345\220\216\344\275\234\344\270\232/QueueNode.class"
new file mode 100644
index 0000000000000000000000000000000000000000..ce63324a4e06f9433f0f623068b9514cb0e3aef2
GIT binary patch
literal 468
zcmZvY%}T>S6ot<uF)=@FVzmD33T|pDcA-1Pjo>O&L~)-qgQV6JN>Y3+7p36B2k@c9
zGlOW+E^^46x!<|>&d2B5JAgABc-X+U2OB#s|2j%`9qc*S7qE(~&IICgoXxYrB&!|=
zH~CnO>T}*z@}(B=)7wTiayTs{P5Yv(%KB2k>>WL@=8CpJn3k0sHqW`7-DmlPPN(-j
zQUTpH{z?N?;@wS~*+^cODksv-8UG}U6E$Q2ACZzEfP>8dE<6GEXGS7_cR`mc+k6az
z9~mkXMm50&5l~w^9qKb{5+Rllue1c(R8ONeLmUl+D}WA7`s)Do=)MM`Z{U<cCIiD{
e2_xw*U?#^4SihZOSiEjg+Z-{ZDs+pUf%prxw@n`a

literal 0
HcmV?d00001

diff --git "a/\350\257\276\345\220\216\344\275\234\344\270\232/QueueTest.class" "b/\350\257\276\345\220\216\344\275\234\344\270\232/QueueTest.class"
new file mode 100644
index 0000000000000000000000000000000000000000..017de1d2d3c75a0e2302ff77fba2f0aacddf03bf
GIT binary patch
literal 649
zcmY*WOK;Oa5dPM2yx6#|A#Hf2K%psa0u4nRkP1i$HBzON7NtU>J#E6O+Tus#N2T2P
z1spkY=@|~G1QI`hKZC>(3CgS^@$gEs<8Qv1`DXU(uTNh9+{Zl!E-r9fbYS3;jmx;A
zy@rDYT-Dw+ZLVvxsIeOyH#wFVtcNOA`D2Dku=0Yze44zH46{8I%V$M2km;@%goK!p
zP%%S2*zX;RBhd*(e9-CVsfrKQb>d7v7sJ<EVpQ@;2!qp4igYNuO6Pme3t7lrndPfG
z-^C0(qC81cF)l+IX>u&PxP`#Q3R)a(7q@Z8#VVREI%v7Li#3fk8SFm=8T`MJwg-oD
zn3LXMQ_K1%(jRBJjA+oLp!ocB43%_tXoj37ks?}W;40gQM)|m0$R0zjEd4)?SR<Vj
z(n8E&PxrA@oXM2xS}N-nVMtCYqvVJtr^Rk!5ohUv^k;yU1&{13{VmYV=&rU-z&?;e
zlF3>nXu!rfoF`vX-=abX=zfOr(sxc!>3xLRo}fB`Re99#o%itCjS2W0gB_oKp9arR
zP;=hFp91y-&hhCt-ODI@EmIf3go7&PsB;6H<XZF$Hr5DzK+-oza*bFX%%7-p%&{Nv
M?HVbYFYDBQ15ZADWB>pF

literal 0
HcmV?d00001

diff --git "a/\350\257\276\345\220\216\344\275\234\344\270\232/QueueTest.java" "b/\350\257\276\345\220\216\344\275\234\344\270\232/QueueTest.java"
new file mode 100644
index 0000000..a17d17f
--- /dev/null
+++ "b/\350\257\276\345\220\216\344\275\234\344\270\232/QueueTest.java"
@@ -0,0 +1,76 @@
+//使用数组实现队列
+public class QueueTest {
+public static void main(String[] args) {
+ArrayQueue queue = new ArrayQueue(10);
+System.out.println(queue.isEmpty());
+for (int i = 0; i < 10; i++) {
+queue.insert(i);
+}
+System.out.println(queue.isFull());
+while (!queue.isEmpty()) {
+System.out.println(queue.remove());
+}
+}
+}
+class ArrayQueue {
+private int[] arrInt;// 内置数组
+private int front;// 头指针
+private int rear;// 尾指针
+public ArrayQueue(int size) {
+this.arrInt = new int[size];
+front = 0;
+rear = -1;
+}
+/**
+* 判断队列是否为空
+*
+* @return
+*/
+public boolean isEmpty() {
+return front == arrInt.length;
+}
+/**
+* 判断队列是否已满
+*
+* @return
+*/
+public boolean isFull() {
+return arrInt.length - 1 == rear;
+}
+/**
+* 向队列的队尾插入一个元素
+*/
+public void insert(int item) {
+if (isFull()) {
+throw new RuntimeException("队列已满");
+}
+arrInt[++rear] = item;
+}
+/**
+* 获得对头元素
+*
+* @return
+*/
+public int peekFront() {
+return arrInt[front];
+}
+/**
+* 获得队尾元素
+*
+* @return
+*/
+public int peekRear() {
+return arrInt[rear];
+}
+/**
+* 从队列的对头移除一个元素
+*
+* @return
+*/
+public int remove() {
+if (isEmpty()) {
+throw new RuntimeException("队列为空");
+}
+return arrInt[front++];
+}
+}
\ No newline at end of file
-- 
Gitee