* 冒泡排序 */publicstaticListNodesort(ListNodehead){if(head==null||head.next==null){returnhead;}// 获取链表长度ListNodelengthNode=head;intlength=0;while(lengthNode!=null){length++;lengthNode=lengthNode.next;}ListNoderesult=null;// 循环冒泡排序for(inti=0;i<length;i++){result=bubbleSort(head...