从单链表中删除最大的元素，单链表元素排序

来源：互联网发布：bbs源码下载编辑：程序博客网时间：2024/06/07 00:40

public class LinkList {public Node head;public LinkList() {head = new Node();head.next = null;}//尾插法public void createByTail(int[] arr, int n) {Node tail = head;for(int i=0; i<n; i++) {Node c = new Node(arr[i]);tail.next = c;tail = c;}tail.next = null;}//头插法public void createByHead(int[] arr, int n) {head.next = null;for(int i=0; i<n; i++) {Node c = new Node(arr[i]);c.next = head.next;head.next = c;}}public void display() {Node p = head.next;while(p != null) {if(p.next != null)System.out.print(p.data + "->");else System.out.println(p.data);p = p.next;}}//删除单链表中元素最大的节点public void delMaxNode() {Node p = head.next, pre = head, maxp = head.next, maxpre = head;while(p != null) {if(p.data > maxp.data) {maxp = p;maxpre = pre;}pre = p;p = p.next;}maxpre.next = maxp.next;        display();}//单链表元素排序public void sort() {Node p = head.next.next;head.next.next = null;Node q, pre;while(p != null) {q = p.next;pre = head;while(pre.next != null && pre.next.data < p.data) {pre = pre.next;}p.next = pre.next;pre.next = p;p = q;}display();}public static void main(String[] args) {int[] arr = new int[]{5,6,1,6,9,3,7,8};LinkList list = new LinkList();list.createByHead(arr, arr.length);list.display();list.createByTail(arr, arr.length);list.display();list.delMaxNode();list.sort();}}class Node {public int data;public Node next;public Node(){}public Node(int data) {this.data = data;}}

结果：

8->7->3->9->6->1->6->55->6->1->6->9->3->7->85->6->1->6->3->7->81->3->5->6->6->7->8

0 0