方式1:
暴力穷举法:
public void creatList() {
Node node1 = new Node(12);
Node node2 = new Node(24);
Node node3 = new Node(36);
Node node4 = new Node(48);
**head = node1;
node1.next = node2;
node2.next = node3;
node3.next = node4;**
}
TestSingleList testSingleList=new TestSingleList();
```这里要注意的有两点:首先必须要有一个节点指向另一个节点,否则默认都是空节点第二必须指明头结点
```方式2:头插,时间复杂度(01)
public void addFirst(int data) {
Node node = new Node(data);
node.next = head;
head = node;
}
`记得更新头部,头插的顺序是逆序的例如
testSingleList.addFirst(10);
testSingleList.addFirst(15);
testSingleList.addFirst(20);
testSingleList.addFirst(30);
testSingleList.addFirst(40);
方式3:尾插法,时间复杂度on,需要遍历单链表
public void addLast(int data) {
Node node = new Node(data);
if (head == null) head = node;
else {
Node cur = head;
while (cur.next != null) {
cur = cur.next;
}
cur.next = node;
}
}