clas sys arr void while nod static pri str

方法：交換鏈表節點的值

public class SortLinked {
public static void main(String[] args) {
int[] a= {1,4,3,2,5};
Node head=arr(a);
Node cur=sort(head1);
while(cur!=null) {
System.out.print(cur.val+"->");
cur=cur.next;
}
System.out.print("null");

}
public static Node sort(Node head) {
if(head==null||head.next==null) return head;

Node currNode=head;
Node nextNode=null;
while(currNode.next!=null) {
nextNode=currNode.next;
while(nextNode!=null) {
if(currNode.val>nextNode.val) {
int temp=currNode.val;
currNode.val=nextNode.val;
nextNode.val=temp;

}
nextNode=nextNode.next;
}
currNode=currNode.next;
}
return head;
}
public static Node arr(int[] a) {
Node dummy=new Node(0);
Node head=dummy;
for(int i=0;i<a.length;i++) {
Node cur=new Node(a[i]);
dummy.next=cur;
dummy=dummy.next;
}
return head.next;

}

}

Java語言 對單鏈表進行排序