实验3 栈和队列

实验报告三栈和队列班级：姓名：学号：专业：一、实验目的：（1）掌握栈的基本操作的实现方法。

（2）利用栈先进后出的特点，解决一些实际问题。

（3）掌握链式队列及循环队列的基本操作算法。

（4）应用队列先进先出的特点，解决一些实际问题。

二、实验内容：1、使用一个栈，将一个十进制转换成二进制。

粘贴源程序：package Ex3;/*** Created by 74062 on 2017/3/11.*/public class Stock<E> {private static class Node<E>{public E data;public Node next;public Node(E data,Node next){this.data = data;this.next = next;}}protected Node<E> head;protected int size;public Stock(){head = new Node<E>(null,null);size =0;}public boolean push(E element){Node<E> node = new Node<E>(element,head.next);head.next = node;size++;return true;}public E pop(){Node<E> node = head.next;if(node==null){return null;}if(node.next!=null){head.next = node.next;}else {head.next = null;}size--;return node.data;}public E top(){if(head.next!=null){return (E) head.next.data;}elsereturn null;}public String toString(){String str = new String();for(Node<E> node = head.next;node!=null;node = node.next){ str += node.data.toString()+" ";}return str;}public static void main(String[] args) {System.out.println(check("a*((b+c)"));}public static boolean check(String string){Stock<Character> stock = new Stock();char ch;for(int i=0;i<string.length();i++){ch = string.charAt(i);if(ch == '('){stock.push(ch);} else if(ch == ')'){if(stock.top()==null){return false;}elsestock.pop();}}if(stock.top() == null)return true;elsereturn false;}}package Ex3.Ex3_1;import Ex3.Stock;/*** Created by 74062 on 2017/3/11.*/public class Test {public static void main(String[] args) {Stock stock = new Stock();int x=15;for(;x!=0;x/=2){stock.push(x%2);}System.out.println(stock);}}粘贴测试数据及运行结果：2、回文是指正读反读均相同的字符序列，如“acdca”、“dceecd”均是回文，但“book”不是回文。

利用1中的基本算法，试写一个算法判定给定的字符串是否为回文。

（提示：将一半字符入栈，依次弹出与另一半逐个比较）粘贴源程序：package Ex3.Ex3_2;import Ex3.Stock;/*** Created by 74062 on 2017/3/11.*/public class Test {public static void main(String[] args) {String string1 = "acdca";String string2 = "dceecd";String string3 = "abcdef";System.out.println(check(string1));System.out.println(check(string2));System.out.println(check(string3));}public static boolean check(String string){boolean flag = true;Stock<Character> stock = new Stock();for(int i=0;i<string.length()/2;i++){stock.push(string.charAt(i));}for(int i=string.length()/2;i<string.length();i++){if(!stock.pop().equals(string.charAt(i))){flag = false;break;}}return flag;}}粘贴测试数据及运行结果：3、使用3个队列分别保留手机上最近10个“未接来电”、“已接来电”、“已拨电话”。

粘贴源程序：package Ex3;/*** Created by 74062 on 2017/3/11.*/public class Queue<E> {private Object[] elements;private int front;private int back;private int size;private Queue(){this(10);}public Queue(int length){elements = new Object[length];front = 0;back = 0;this.size = 0;}public boolean push(E element){if(size==elements.length){pop();}elements[back++] = element;if(back>=elements.length){back = 0;}size++;return true;}public E pop(){int i = front;if(front+1 == elements.length){front = 0;}size--;return (E)elements[i];}public String toString(){String string = new String();int j = back;for(int i=0;i<size;i++){string+=elements[j]+" ";if(++j==elements.length){j=0;}}return string;}public static void main(String[] args) {Queue<Integer> queue = new Queue<Integer>(5);queue.push(1);queue.push(2);queue.push(3);queue.push(4);queue.push(5);queue.push(6);queue.push(7);System.out.println(queue);}}package Ex3.Ex3_3;import Ex3.Queue;import java.util.Random;/*** Created by 74062 on 2017/3/11.*/public class Test {public static void main(String[] args) {String[] name = new String[]{"林伟健","冮君泽","张思远","李哲"}; Queue<String> weijielaidian = new Queue<String>(10);Queue<String> yijielaidian = new Queue<String>(10);Queue<String> yibodianhua = new Queue<String>(10);for(int i=0;i<15;i++){weijielaidian.push(name[Math.abs(newRandom().nextInt()%4)]);yijielaidian.push(name[Math.abs(newRandom().nextInt()%4)]);yibodianhua.push(name[Math.abs(new Random().nextInt()%4)]); }System.out.println("未接电话 "+weijielaidian);System.out.println("已接电话 "+yijielaidian);System.out.println("已拨电话 "+yibodianhua);}}粘贴测试数据及运行结果：三、心得体会：（含上机中所遇问题的解决办法，所使用到的编程技巧、创新点及编程的心得）。