編集履歴

質問編集履歴

文の修正

2021/11/17 20:05

投稿

frere

スコア4

test CHANGED Viewed

File without changes

test CHANGED Viewed

@@ -204,538 +204,4 @@
-キュー(線形リスト)
-package exer3.queue;
-import java.util.StringJoiner;
-public class LinkedListQueue<T> implements Queue<T> {
-private class Node {
-    T data;
-    Node next;
-    Node(T d) {
-        data = d;
-        next = null;
-    }
-    void ins(Node n) {
-        n.next = next;
-        next = n;
-    }
-}
-    private Node in;
-    private Node out;
-    public LinkedListQueue(){
-        clear();
-    }
-    public boolean enqueue(T d){
-        in.ins(new Node(d));
-        in = in.next;
-        return true;
-    }
-    public T dequeue(){
-        if (isEmpty())
-            return null;
-        if (out.next == in)
-            in = out;
-        T ans = out.next.data;
-        out.next = out.next.next;
-        return ans;
-    }
-    public boolean isEmpty() {
-        return (in == out);
-    }
-    public void clear() {
-        in = new Node(null);
-        out = in;
-    }
-    public String toString() {
-        StringJoiner j = new StringJoiner(",");
-        for (Node p = out; null != p.next; p = p.next)
-        j.add(p.next.data.toString());
-        return " [" + j.toString() + "]";
-    }
-}
-キュー(循環リスト)
-package exer3.queue;
-import java.util.StringJoiner;
-import exer3.linkedStructure.CircularlyLinkedList;
-public class CircularListQueue<T> implements Queue<T> {
-    private CircularlyLinkedList<T> data;
-    public CircularListQueue() {
-    clear();
-    }
-    public boolean enqueue(T d) {
-        data.insertZ(d);
-        return true;
-    }
-    public T dequeue() {
-        CircularlyLinkedList<T>.Node p = data.getFirst();
-        T ans = data.get(p);
-        data.delete(p);
-        return ans;
-    }
-    public boolean isEmpty() {
-        return data.isEmpty();
-    }
-    public void clear() {
-        data = new CircularlyLinkedList<>();
-    }
-    public String toString() {
-        if (isEmpty()) {
-        return " []";
-        } else {
-            StringJoiner j = new StringJoiner(",");
-            CircularlyLinkedList<T>.Node p = data.getFirst();
-        do {
-            j.add(data.get(p).toString());
-            p = data.getNext(p);
-        } while (! data.isFirst(p));
-        return " [" + j.toString() + "]";
-        }
-    }
-}
-線形リスト
-package exer3.linkedStructure;
-import java.util.StringJoiner;
-public class CircularlyLinkedList<T> {
-    public class Node{
-        T data;
-        Node next;
-        Node(){
-            data = null;
-            next = null;
-        }
-        Node(T d){
-            this();
-            data = d;
-        }
-        void ins(Node n){
-            n.next = next;
-            next = n;
-        }
-    }
-    private Node tail;
-    public CircularlyLinkedList() {
-        tail = null;
-    }
-    public String toString() {
-        Node p;
-        StringJoiner j = new StringJoiner("\n");
-            if (null != (p = tail)) {
-                do {
-                  j.add(p.next.data.toString());
-                } while (tail != (p = p.next));
-            }
-            j.add("-----");
-            return j.toString();
-    }
-    public Node search(T d) {
-        Node p;
-        if (null != (p = tail)) {
-            do {
-        if (p.next.data.equals(d))
-                return p;
-            } while (tail != (p = p.next));
-        }
-            return null;
-    }
-    public CircularlyLinkedList<T> insertA(T d) {
-         if (null == tail) {
-            tail = new Node(d);
-            tail.next = tail;
-        } else
-            tail.ins(new Node(d));
-            return this;
-    }
-    public CircularlyLinkedList<T> insertP(T d, Node p) {
-        if (null != p)
-            p.ins(new Node(d));
-        return this;
-    }
-    public CircularlyLinkedList<T> insertZ(T d) {
-          insertA(d);
-          tail = tail.next;
-        return this;
-    }
-    public T get(Node p) {
-         return (null == p ? null : p.next.data);
-    }
-    public CircularlyLinkedList<T> delete(Node p) {
-        if (null != p) {
-            if (p.next == p)
-             tail = null;
-            else {
-            if (p.next == tail)
-                    tail = p;
-                p.next = p.next.next;
-            }
-        }
-        return this;
-    }
-    public Node getFirst() {
-        return tail;
-    }
-    public Node getNext(Node p) {
-        return (null == p ? null : p.next);
-    }
-    public boolean isFirst(Node p) {
-        return (p == tail);
-    }
-    public boolean isEmpty() {
-        return (null == tail);
-    }
-}
-メインクラス
-package exer3.queue.tester;
-import exer3.queue.*;
-import java.io.*;
-public class Main {
-    public static void main(String[] args) throws IOException {
-        String line;
-        Queue<String> q1, q2, q3;
-        q1 = new FixedArrayQueue<>(3);
-        q2 = new LinkedListQueue<>();
-        q3 = new CircularListQueue<>();
-        BufferedReader r =
-            new BufferedReader(new InputStreamReader(System.in));
-        while (null != (line = r.readLine())) {
-        if (line.equals("d"))
-            dequeueAction(q1, q2, q3);
-        else
-            enqueueAction(line, q1, q2, q3);
-        }
-            r.close();
-            System.out.println("-----");
-        while (!q3.isEmpty())
-            dequeueAction(q1, q2, q3);
-    }
-    private static void enqueueAction(String line, Queue<String> a,
-        Queue<String> b, Queue<String> c) {
-        a.enqueue(line); System.out.println(a);
-        b.enqueue(line); System.out.println(b);
-        c.enqueue(line); System.out.println(c);
-        }
-    private static void dequeueAction(Queue<String> a, Queue<String> b,
-        Queue<String> c) {
-        String x = a.dequeue();
-        String y = b.dequeue();
-        String z = c.dequeue();
-        if ((x != y) || (y != z))
-            System.out.println("NG");
-        else {
-            System.out.print(x);
-            System.out.println(a);
-            }
-        }
-}
 ```