【数据结构】单链表(二)单链表的逆置,合并与删除

前端之家收集整理的这篇文章主要介绍了【数据结构】单链表(二)单链表的逆置,合并与删除前端之家小编觉得挺不错的,现在分享给大家,也给大家做个参考。

接下来我们讨论下链表的一些高级操作

逆置(循环写法):

  1. public Node reverse(Node head) {
  2. Node reverseHead = null;
  3. Node runner = head;
  4. while (runner != null) {
  5. Node next = runner.next;
  6. runner.next = reverseHead;
  7. reverseHead = runner;
  8. runner = next;
  9. }
  10. return reverseHead;
  11. }

逆置(递归写法):

  1. public static Node reverseRec(Node head) {
  2. if(head==null)
  3. return head;
  4. return reverseRec(head,head.next);
  5. }
  6.  
  7. public static Node reverseRec(Node prev,Node curr) {
  8. if(curr==null)
  9. return prev;
  10. Node reverseHead = reverseRec(prev.next,curr.next);
  11. curr.next=prev;
  12. prev.next=null;
  13. return reverseHead;
  14. }

合并:

  1. public static void merge(Node head1,Node head2) {
  2. while (head1 != null && head2 != null) {
  3. if (head1.next == null) {
  4. head1.next = head2;
  5. return;
  6. }
  7. Node next = head2.next;
  8. head2.next = head1.next;
  9. head1.next = head2;
  10. head1 = head2.next;
  11. head2 = next;
  12. }
  13. }


删除

  1. public void deleteNode(Node Delete) {
  2. if (Delete == null || Delete.next == null)
  3. return;
  4. Delete.item = Delete.next.item;
  5. Delete.next = Delete.next.next;
  6. }

猜你在找的数据结构相关文章