java单向链表基本操作简单实现

package com.htsc.link;

public class Link
{
Node head;

public Link()
{
super();
this.head = new Node();
}

public Node getHead()
{
return head;
}

public void setHead(Node head)
{
this.head = head;
}

//插入
public boolean insert(int data){
Node node = new Node(data);
Node tmp = head;
while (tmp.next != null) {
tmp = tmp.next;
}
tmp.next = node;
return true;
}

//知道头结点删除
public boolean delete(int index){
if(index <= 0 || index > length()){
return false;
}
Node temp = head;
for(int i = 1; i < index; i++){
temp = temp.next;
}
temp.next = temp.next.next;
return true;
}

//计算链表长度
public int length(){
int length = 0;
Node temp = head;
while(temp.next != null){
temp = temp.next;
length++;
}
return length;
}

//遍历
public void show(){
Node temp = head;
while (temp.next != null) {
System.out.println(temp.next.data);
temp = temp.next;
}
}
}

package com.htsc.link;

public class Node
{
Node next = null;
int data;

public Node()
{
super();
}

public Node(int data)
{
super();
this.data = data;
}

public Node getNext()
{
return next;
}
public void setNext(Node next)
{
this.next = next;
}
public int getData()
{
return data;
}
public void setData(int data)
{
this.data = data;
}

}