双向链表java实现

import java.util.Iterator;

public class TwoWayLink implements Iterable {

  Node head = null;
  Node tail = null;

  int size;

  class Node {
    Node next = null;
    Node previous = null;
    int data;

    public Node(int data) {
      this.data = data;
    }

    @Override
    public String toString() {
      return "data:" + data;
    }
  }

  public void addNode(int d) {
    Node newNode = new Node(d);
    if (head == null) {
      head = newNode;
      tail = newNode;
      size = 1;
      return;
    }

    Node tailTmp = tail;
    tailTmp.next = newNode;
    newNode.previous = tailTmp;
    tail = newNode;
    size++;
  }

  public Node getNode(int index) {
    if (index == 0) {
      return head;
    }
    if (index + 1 == size) {
      return tail;
    }
    int i = 1;
    Node curNode = head.next;
    while (curNode != null) {
      if (i == index) {
        return curNode;
      }
      curNode = curNode.next;
      i++;
    }
    return null;
  }

  public Node removeNode(Node remove) {
    Node previous = remove.previous;
    Node next = remove.next;
    if (remove.equals(head)) {
      next.previous = null;
      head = next;
    } else if (remove.equals(tail)) {
      previous.next = null;
      tail = previous;
    } else {
      previous.next = next;
      next.previous = previous;
    }
    size--;
    return remove;
  }

  public int size() {
    return size;
  }

  @Override
  public Iterator iterator() {
    return new Iterator() {
      int cursor;
      int lastRet = -1;

      @Override
      public boolean hasNext() {
        return cursor != size;
      }

      @Override
      public Object next() {
        lastRet = cursor;
        cursor++;
        return getNode(lastRet);
      }
    };
  }

  public static void main(String[] args) {
    TwoWayLink twoWayLink = new TwoWayLink();
    twoWayLink.addNode(1);
    twoWayLink.addNode(2);
    twoWayLink.addNode(3);
    System.out.println(twoWayLink.size());
    Iterator iterator = twoWayLink.iterator();
    while (iterator.hasNext()) {
      System.out.println(iterator.next());
    }
  }

}
  • 0
    点赞
  • 5
    收藏
    觉得还不错? 一键收藏
  • 3
    评论
双向链表是一种数据结构,每个节点包含了指向前一个节点和后一个节点的指针。在 Java 中,可以使用自定义类来实现双向链表。以下是一个简单的双向链表实现示例: ```java public class DoublyLinkedList { private Node head; private Node tail; private class Node { int data; Node prev; Node next; public Node(int data) { this.data = data; this.prev = null; this.next = null; } } public void addToFront(int data) { Node newNode = new Node(data); if (head == null) { head = newNode; tail = newNode; } else { newNode.next = head; head.prev = newNode; head = newNode; } } public void addToBack(int data) { Node newNode = new Node(data); if (head == null) { head = newNode; tail = newNode; } else { tail.next = newNode; newNode.prev = tail; tail = newNode; } } public void remove(int data) { Node current = head; while (current != null) { if (current.data == data) { if (current == head) { head = current.next; if (head != null) { head.prev = null; } } else if (current == tail) { tail = current.prev; if (tail != null) { tail.next = null; } } else { current.prev.next = current.next; current.next.prev = current.prev; } break; } current = current.next; } } public void printList() { Node current = head; while (current != null) { System.out.print(current.data + " "); current = current.next; } System.out.println(); } } ``` 以上代码中的 `DoublyLinkedList` 类实现双向链表的常见操作,如在头部和尾部添加节点、删除指定节点以及打印链表。你可以创建 `DoublyLinkedList` 对象并调用相应的方法来操作双向链表

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 3
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值