单向链表的创建和操作

public class SinglyLinkedListDemo {


/**
* <p>MethodName:main </p>
* <p>Description: </p>
* <p>@param args</p> 
* <p>Return:void </p> 
* @author Sunny
* @date 2016-9-27下午9:30:39 
*/
public static void main(String[] args) {
SinglyLinkedList list=new SinglyLinkedList();
list.addFirstNode(1);
list.addFirstNode(2);
list.addFirstNode(3);
list.addFirstNode(4);
list.printAllNodes();

list.addNode(4, 5);
list.addNode(5, 6);
list.addNode(6, 7);
list.addNode(7, 8);
list.addNode(8, 9);
list.printAllNodes();

list.deleteFirstNode();
list.deleteNodeByData(6);
list.deleteNodeByPos(3);
list.printAllNodes();


}


}


/**
 * 
* <p>Title:SinglyLinkedList </p>
* <p>Description:简单单向链表 类</p>
* <p>Company: </p> 
* @author Sunny
* @date 2016-9-28下午11:12:45
 */
class SinglyLinkedList{
Node first;
int pos=0;

//空链表
public SinglyLinkedList(){
first=null;
}
//插入头节点
public void addFirstNode(int data){
Node node=new Node(data);
node.next=first;
first=node;
}
//删除头节点
public Node deleteFirstNode(){
Node node=new Node(first.data);
first=first.next;
return node;
}
//在任意位置插入节点
public void addNode(int index,int data){
Node node=new Node(data);
Node previous=first;
Node current=first;
while(pos!=index){
previous=current;
current=current.next;
pos++;
}
previous.next=node;
node.next=current;
pos=0;
}
//根据位置删除节点
public Node deleteNodeByPos(int index){
Node previous=first;
Node current=first;
while(pos!=index){
if(current.next==null){
return null;
}
previous=current;
current=current.next;
pos++;
}
previous.next=current.next;
pos=0;
return current;
}
//根据数据删除节点
public Node deleteNodeByData(int data){
Node previous=first;
Node current=first;
while(current.data!=data){
if(current.next==null){
System.out.println();
return null;
}
previous=current;
current=current.next;
}
if(current==first){
first=first.next;
}else{
previous.next=current.next;
}
return current;
}
//根据位置查找节点
public Node findNodeByPos(int index){
Node current=first;
while(pos!=index){
if(current.next==null){
return null;
}
current=current.next;
pos++;
}
pos=0;
return current;
}
//根据数据查找节点
public Node findNodeBydata(int data){
Node current=first;
while(current.data!=data){
if(current.next==null){
return null;
}
current=current.next;
pos++;
}
pos=0;
return current;
}
//显示所有节点值
public void printAllNodes(){
Node current=first;
while(current!=null){
System.out.print(current.data+"->");
current=current.next;
}
System.out.println("null");
}
}


/**
 * 
* <p>Title:Node </p>
* <p>Description:节点类 </p>
* <p>Company: </p> 
* @author Sunny
* @date 2016-9-28下午11:12:07
 */
class Node{
int data;
Node next;
public Node(int data){
this.data=data;
next=null;
}

}

4->3->2->1->null
4->3->2->1->5->6->7->8->9->null
3->2->1->7->8->9->null