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
相关推荐
努力写代码的熊大11 分钟前
链式二叉树数据结构(递归)yi.Ist11 分钟前
数据结构 —— 键值对 map爱学习的小邓同学12 分钟前
数据结构 --- 队列s1533514 分钟前
数据结构-顺序表-猜数字闻缺陷则喜何志丹15 分钟前
【前缀和 BFS 并集查找】P3127 [USACO15OPEN] Trapped in the Haybales G|省选-lifallen6 小时前
Paimon LSM Tree Compaction 策略秋说11 小时前
【PTA数据结构 | C语言版】线性表循环右移minji...15 小时前
数据结构 算法复杂度(1)black_blank16 小时前
st表 && csp37 第四题 集体锻炼我爱Jack16 小时前
Java List 使用详解:从入门到精通