Insert in a sorted list

public class OneLinkNode { public int data; public OneLinkNode next; public OneLinkNode(int k) { data = k; next = null; } public OneLinkNode() { this(0); } public static void main(String args[]) { int n = 8; OneLinkNode head = create(n); insert(head, 3); OneLinkNode p = head; for (int i = 0; i < n + 1; i++) { System.out.print(p.data + " "); p = p.next; } }

public static OneLinkNode create(int n) { // 建立单链表 OneLinkNode rear, q, head = null; if (n > 0) { int k =0; head = new OneLinkNode(0); rear = head; for (int i = 1; i < n ; i++) { q = new OneLinkNode(i); rear.next = q; rear = q; } } return head; }

public static boolean insert(OneLinkNode head, int data) {// 在第n个后插入data if (head == null) return false; OneLinkNode p = head; while(data>p.data) p = p.next; OneLinkNode newNode = new OneLinkNode(); newNode.data = data; newNode.next = p.next; p.next = newNode; return true; } public static boolean delete(OneLinkNode head, int n) {// 把第n个删除 if (head == null) return false; OneLinkNode p1 = head; for (int i = 0; i < n - 2; i++) { p1 = p1.next; } p1.next = p1.next.next; return true; }}

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。