Java实现简练单链表代码
package 链表;
import javax.print.attribute.standard.NumberOfDocuments;
import static com.sun.tools.classfile.CharacterRangeTable_attribute.Entry.length;
class Node{
Node next = null;
int data;
public Node(int data) {
this.data = data;
}
}
public class MyLinkedList {
Node head = null;
/**
* 链表的插入
* @param d 插入链表的数据
*/
public void addNode(int d){
//新建一个节点
Node newNode = new Node(d);
//链表为空
if(null == head){
head = newNode;
return;
}
//循环找到链表的末尾
Node tmp = head;
while (tmp.next!=null){
tmp=tmp.next;
}
tmp.next = newNode;
}
/**
*
* @param index 链表的索引
* @return 如果索引小于1或者索引大于链表的长度返回false
* 删除成功返回true
*/
public boolean deleteNode(int index){
if(index<1||in