1、链表创建
public class ListNode{
int value;
ListNode next=null;
public ListNode(int x){
this.value=x;
}
}
2、链表添加
public void addNode(int x){
ListNode list=new ListNode(x);
if(head==null){
head=list;
return;
}
tem=head;
while(tem.next!=null){
tem=tem.next;
}
tem.next=list;
}
3、链表遍历
public void printNode(ListNode head) {
while(head!=null) {
System.out.println(head.value);
head=head.next;
}
}
4、链表翻转
public ListNode ReverseList(ListNode head) {
ListNode nex;
ListNode pre;
ListNode now;
nex=null;
pre=null;
now=head;
if(now==null) {
return null;
}
while(now!=null){
nex=now.next;
now.next=pre;
pre=now;
now=nex;
}
return pre;
}