package cn.dragon.arithmetic.model;
import java.util.NoSuchElementException;
//单向链表
public class MySingleTrackLInkedList<T> {
private static class Node<T> {
T val;
Node<T> next;
public Node(T val) {
this.val = val;
this.next = null;
}
}
private Node<T> head;
private Node<T> tail;
private int size;
public MySingleTrackLInkedList() {
this.head = new Node<>(null);
this.tail = head;
this.size = 0;
}
public void addFirst(T d) {
Node<T> newNode = new Node<>(d);
newNode.next = head.next;
head.next = newNode;
if (size == 0) {
tail = newNode;
}
size++;
}
public void addLast(T d) {
Node<T> newNode = new Node<>(d);
tail.next = newNode;
tail = newNode;
size++;
}
public void add(int index, T element) {
checkPositionIndex(index);
if (index == size) {
addLast(element);
return;
}
Node<T> prev = head;
for (int i = 0; i < index; i++) {
prev = prev.next;
}
Node<T> newNode = new Node<>(element);
newNode.next = prev.next;
prev.next = newNode;
size++;
}
public T removeFirst() {
if (isEmpty()) {
throw new NoSuchElementException();
}
Node<T> first = head.next;
head.next = first.next;
if (size == 1) {
tail = head;
}
size--;
return first.val;
}
public T removeLast() {
if (isEmpty()) {
throw new NoSuchElementException();
}
Node<T> prev = head;
while (prev.next != tail) {
prev = prev.next;
}
T val = tail.val;
prev.next = null;
tail = prev;
size--;
return val;
}
public T remove(int index) {
checkElementIndex(index);
Node<T> prev = head;
for (int i = 0; i < index; i++) {
prev = prev.next;
}
Node<T> nodeToRemove = prev.next;
prev.next = nodeToRemove.next;
if (index == size - 1) {
tail = prev;
}
size--;
return nodeToRemove.val;
}
public T getFirst() {
if (isEmpty()) {
throw new NoSuchElementException();
}
return head.next.val;
}
public T getLast() {
if (isEmpty()) {
throw new NoSuchElementException();
}
return getNode(size - 1).val;
}
public T get(int index) {
checkElementIndex(index);
Node<T> p = getNode(index);
return p.val;
}
public int size() {
return size;
}
public boolean isEmpty() {
return size == 0;
}
private boolean isElementIndex(int index) {
return index >= 0 && index < size;
}
private boolean isPositionIndex(int index) {
return index >= 0 && index <= size;
}
private void checkElementIndex(int index) {
if (!isElementIndex(index)){
throw new IndexOutOfBoundsException();
}
}
private void checkPositionIndex(int index) {
if (!isPositionIndex(index)) {
throw new IndexOutOfBoundsException();
}
}
private Node<T> getNode(int index) {
Node<T> p = head.next;
for (int i = 0; i < index; i++) {
p = p.next;
}
return p;
}
public static void main(String[] args) {
MySingleTrackLInkedList<Integer> list = new MySingleTrackLInkedList<>();
list.addFirst(1);
list.addFirst(2);
list.addLast(3);
list.addLast(4);
list.add(2, 5);
System.out.println(list.removeFirst()); // 2
System.out.println(list.removeLast()); // 4
System.out.println(list.remove(1)); // 5
System.out.println(list.getFirst()); // 1
System.out.println(list.getLast()); // 3
System.out.println(list.get(1)); // 3
}
}
数据结构-自定义单链表
Dragonlongbo2024-11-05 13:59
相关推荐
就爱学编程10 分钟前
重生之我在异世界学编程之C语言小项目:通讯录ALISHENGYA1 小时前
全国青少年信息学奥林匹克竞赛(信奥赛)备考实战之分支结构(实战项目二)DARLING Zero two♡2 小时前
【优选算法】Pointer-Slice:双指针的算法切片(下)波音彬要多做3 小时前
41 stack类与queue类Noah_aa3 小时前
代码随想录算法训练营第五十六天 | 图 | 拓扑排序(BFS)KpLn_HJL4 小时前
leetcode - 2139. Minimum Moves to Reach Target ScoreAC使者10 小时前
5820 丰富的周日生活无 证明10 小时前
new 分配空间;引用别NULL14 小时前
机试题——疯长的草