stack · Pull Request !54 · SE-193/lec03-stack-queue

.idea/workspace.xml
<?xml version="1.0" encoding="UTF-8"?>
<project version="4">
  <component name="PropertiesComponent">
    <property name="last_opened_file_path" value="F:/java 更新" />
  </component>
</project>
\ No newline at end of file
 Quetion.java
public class Quetion {
    private Node begin;
    private Node fina;
    private int size;

public Quetion() {
        begin = null;
        fina = null;
        size = 0;
    }

public void push(int item) throws Exception {//往队列中添加元素
        Node newNode;
        if (size == 0) {
            newNode = new Node(null, null, item);
            begin = newNode;
        } else {
            newNode = new Node(fina, null, item);
            fina.next = newNode;
        }
        fina= newNode;
        size++;
    }

public int pop() throws Exception {//队列第一个元素出列
        if (size == 0) {
            throw new Exception("QueueEmpty");
        } else {
            int temporary = begin.item;
            if (size == 1) {
                begin = null;
                fina= null;
            } else {
                begin = begin.next;
                begin.perv = null;
            }
            size--;
            return temporary;
        }
    }

public int peek() throws Exception {//查看队列的第一个元素
        return begin.item;
    }

private Node jump(int position) throws Exception {//通过用户给予的位置信息，移动至指定位置
        if (position > 0 && position <= size) {
            Node nowNode = begin;
            while (position - 1 != 0) {
                nowNode = nowNode.next;
                position--;
            }
            return nowNode;
        } else {
            System.out.println("error...");
            throw new Exception("error...");
        }
    }
    private static class Node {
        private Node perv;
        private Node next;
        private final int item;

public Node(Node perv, Node next, int item) {
            this.perv = perv;
            this.next = next;
            this.item = item;
        }
    }
}
 QueueArrat.java
public class QueueArrat {
    private int[] queue;
    private int top;//指向最新进来的元素的下一个元素

public QueueArrat(int size) {
        queue = new int[size];
        top = 0;
    }

public void ADD(int item) throws Exception {//往队列中添加元素
        if (top > queue.length) {
            throw new Exception("QueueOverflowError");
        } else {
            queue[top] = item;
            top++;
        }
    }

public int first() throws Exception {//队列第一个元素出列
        if (top == 0) {
            throw new Exception("QueueEmpty");
        } else {
            int oldOne = queue[0];
            System.arraycopy(queue, 1, queue, 0, top);
            top--;
            return oldOne;
        }
    }

public int peek() throws Exception {//查看队列的第一个元素
        if (top == 0) {
            throw new Exception("QueueEmpty");
        } else {
            return queue[0];
        }
    }

public String toString() {
        for (int i = 0; i < top; i++) {
            System.out.print(queue[i] + ", ");
        }
        System.out.println();
        return null;
    }
}
 StackArray.java
public class StackArray {
    private int[] stack;
    private int top;//指向新进来的元素的前面

public StackArray(int size) {//构造方法
        stack = new int[size];
        this.top = 0;
    }

public void addtion(int item) throws Exception {//往栈中添加元素
        if (top > stack.length) {
            throw new Exception("StackOverflowError");
        } else {
            stack[top] = item;
            top++;
        }
    }

public int reduce() throws Exception {//栈顶元素出栈
        if (top == 0) {
            throw new Exception("StackEmpty");
        } else {
            return stack[--top];
        }
    }

public int peek() throws Exception {//查看栈顶元素
        if (top == 0) {
            throw new Exception("StackEmpty");
        } else {
            return stack[top - 1];
        }
    }

public String toString() {
        for (int i = top - 1; i >= 0; i--) {
            System.out.print(stack[i] + ", ");
        }
        System.out.println();
        return null;
    }
}
 Stacktion.java
import javax.xml.soap.Node;

public class Stacktion {
    private Node fina;
    private int size;

public Stacktion() {//栈定义
        fina = null;
        size = 0;
    }

private static class Node {//初始化节点
        private Node perv;
        private Node next;
        private final int item;

public Node(Node perv, Node next, int item) {
            this.perv = perv;
            this.next = next;
            this.item = item;
        }
    }

public void push(int item) throws Exception {//往栈中添加元素
        Node newNode;
        if (size == 0) {
            newNode = new Node(null, null, item);
        } else {
            newNode = new Node(fina, null, item);
            fina.next = newNode;
        }
        fina = newNode;
        size++;
    }

public int reduce() throws Exception {//栈顶出栈的方法
        if (size == 0) {
            throw new Exception("StackEmpty");
        } else {
            int temporary = fina.item;
            if (size == 1) {
                fina = null;
            } else {
                fina = fina.perv;
                fina.next = null;
            }
            size--;
            return temporary;
        }
    }
    private Node jump(int userput) throws Exception {//通过用户给予的位置信息，移动至指定位置
        if (userput> 0 && userput <= size) {
            Node nowNode = fina;
            int frequency = size - userput;
            while (frequency != 0) {
                nowNode = nowNode.perv;
                frequency--;
            }
            return nowNode;
        } else {
            throw new Exception("错误");
        }
    }

public String toString() {
        for (int i = size; i > 0; i--) {
            try {
                System.out.print(jump(i).item + ", ");
            } catch (Exception e) {
                e.printStackTrace();
            }
        }
        System.out.println();
        return null;
    }

}

类型	指派人员	状态
审查	zan	进行中 (0/1人)
测试	zan	进行中 (0/1人)

SE-193/lec03-stack-queue .gitee-modal { width: 500px !important; }

搜索帮助

SE-193/lec03-stack-queue