实现toString方法以打印出LinkedList

Question

我的OOP课程项目有问题.我差不多完成了,但仍缺少toString方法和主要方法.不确定如何去做,并希望得到任何帮助.我希望我的toString方法功能如下:

返回列表中存储的所有项的字符串表示形式.空列表head--><--tail 的字符串表示形式类似于非空列表的字符串表示形式如下所示: head-->134<-->-8<-->42<-->1<--tail

public class IntegerNode{

    private IntegerNode next;
    private IntegerNode prev;
    private int data;

    public IntegerNode(int data){
        next = next; 
        prev = prev;
        data = data;     
    }

    public int getData(){
        data = data;
        return this.data;   
    }

    public IntegerNode getNext(){
        return next;
    }

    public IntegerNode getPrevious(){
        return prev;
    }

    public void setNext(IntegerNode in){
        prev = in;
    }

    public void setPrevious(IntegerNode in){
        prev = in;
    }

}

这是我目前在IntegerLinkedList类中的内容

public class IntegerLinkedList{

    private IntegerNode head;
    private IntegerNode tail;

    public IntegerLinkedList(){
        head = null;
        tail = null;
    }

    public void addFirst(int x){
        IntegerNode nH = new IntegerNode(x);
        if (head == null) {
            head = nH;
            tail = nH;
        }else{
            head.setPrevious(nH);
            nH.setNext(head);
            head = nH;

        }
    }

    public void addLast(int x){
        IntegerNode t = new IntegerNode(x);
        if (tail == null){
            head = t;
            tail = t;
        }else{
            tail.setNext(t);
            t.setPrevious(tail);
            tail = t;
        }
    }

    public int peekFirst(){
        return head.getData();
    }

    public int peekLast(){
        return tail.getData();
    }

    public String toString(){
        if (head == null && tail == null){
            String empty = "head--><--tail";
            return empty;
        }else{
            String h = "Head--> " + head;
            String t = tail + " <--Tail";
            String m = " <--> ";
           // while(IntegerNode.getNext() != null) 
           //}
           //return h + m + t;

        }
    }

    public int pollFirst(){
        int x = head.getData();
        head = head.getNext();
        head.setPrevious(null);
        return x;
    }

    public int pollLast(){
        int x = tail.getData();
        tail = tail.getPrevious();
        tail.setNext(null);
        return x;
    }

}

我想有一段时间循环就是去这里的方式,但是我又不确定了.

Answer 1

以下是编写它的方法:

@Override  // <-- Annotate that you are overriding the toString() method
public String toString(){
    if (head == null && tail == null){
        String empty = "head--><--tail";
        return empty;
    }else{
       StringBuilder sb = new StringBuilder();
       sb.append("Head-->");

       IntegerNode curr = head;
       sb.append(curr.getData());
       curr = curr.getNext();
       while(curr != null) {
           sb.append("<-->");
           sb.append(curr.getData());
           curr = curr.getNext();
       }
       sb.append("<--tail");
       return sb.toString();
    }
}

作为替代方案,您可以将逻辑简化为不具有外部if else:

@Override  // <-- Annotate that you are overriding the toString() method
public String toString(){
   StringBuilder sb = new StringBuilder();
   sb.append("Head-->");

   IntegerNode curr = head;

   if (curr == null)
   {
      sb.append("<--tail");
      return sb.toString();
   }

   sb.append(curr.getData());
   curr = curr.getNext();
   while(curr != null) {
       sb.append("<-->");
       sb.append(curr.getData());
       curr = curr.getNext();
   }
   sb.append("<--tail");

   return sb.toString();
}