package com.arithmetic;/*** 单链表*/
public class SingleLinked {Node first;int N;SingleLinked() {N = 0;}// 头插法void addHeadNode(Node n) {n.next = first;first = n;N++;}// 删除头结点void delHeadNode() {first = first.next;N--;}// 在表尾插入节点void addTailNode(Node n) {if (first == null) {first = n;} else {Node temp = first;while (temp.next != null) {temp = temp.next;}temp.next = n;}N++;}// 遍历链表void displayNodes() {for (Node k = first; k != null; k = k.next) {System.out.println(k.getData());}}public int size() {return N;}public static void main(String[] args) {SingleLinked linked = new SingleLinked();linked.addHeadNode(new Node<String>("10"));linked.addHeadNode(new Node<String>("20"));linked.addHeadNode(new Node<String>("30"));System.out.println(linked.size());linked.displayNodes();}
}