package com.zf.test.linken;
/**
* @program: test
* @description: 测试链表的结构
* @author: liuzongfang
* @create: 2019-08-15 09:14
**/
public class LinkenList {
//头结点指针
private Node head;
//尾结点指针
private Node last;
//链表的实际长度
private int size;
/**
* 链表插入元素
* @param data 插入元素
* @param index 插入位置
*/
public void insert(int data,int index) throws Exception{
if(index<0 || index >size){
throw new IndexOutOfBoundsException("超出链表结点范围");
}
Node insertedNode = new Node(data);
if(size == 0){
//空链表
head = insertedNode;
last = insertedNode;
}else if (index == 0){
//插入头部
insertedNode.next = head;
head = insertedNode;
}else if(size == index){