java listnode 合并链表_java实现两个有序单链表合并

本次分享的事两个有序单链表的合并，

遍历方法递归

非递归

节点类/*** @auther: lawt* @date: 2018/11/4 08* @Description: 结点信息*/public class Node {/**    * 为了方便，这两个变量都使用public，而不用private就不需要编写get、set方法了。    * 存放数据的变量，简单点，直接为int型    */   public int data;   /**    * 存放结点的变量,默认为null    */   public Node next;   /**    * 构造方法，在构造时就能够给data赋值    */   public Node(int data) {this.data = data;   }}

实现类

/**

* @auther: lawt

* @date: 2018/11/6 09

* @Description: 两个有序单链表合并

*/

public class MyList {

/**

* 递归方式合并两个单链表

*

* @param head1 有序链表1

* @param head2 有序链表2

* @return 合并后的链表

*/

public static Node mergeTwoList(Node head1, Node head2) {

//递归结束条件

if (head1 == null && head2 == null) {

return null;

}

if (head1 == null) {

return head2;

}

if (head2 == null) {

return head1;

}

//合并后的链表

Node head = null;

if (head1.data > head2.data) {

//把head较小的结点给头结点

head = head2;

//继续递归head2

head.next = mergeTwoList(head1, head2.next);

} else {

head = head1;

head.next = mergeTwoList(head1.next, head2);

}

return head;

}

/**

* 非递归方式

*

* @param head1 有序单链表1

* @param head2 有序单链表2

* @return 合并后的单链表

*/

public static Node mergeTwoList2(Node head1, Node head2) {

if (head1 == null || head2 == null) {

return head1 != null ? head1 : head2;

}

//合并后单链表头结点

Node head = head1.data < head2.data ? head1 : head2;

Node cur1 = head == head1 ? head1 : head2;

Node cur2 = head == head1 ? head2 : head1;

Node pre = null;//cur1前一个元素

Node next = null;//cur2的后一个元素

while (cur1 != null && cur2 != null) {

//第一次进来肯定走这里

if (cur1.data <= cur2.data) {

pre = cur1;

cur1 = cur1.next;

} else {

next = cur2.next;

pre.next = cur2;

cur2.next = cur1;

pre = cur2;

cur2 = next;

}

}

pre.next = cur1 == null ? cur2 : cur1;

return head;

}

public static void main(String[] args) {

Node node1 = new Node(1);

Node node2 = new Node(2);

Node node3 = new Node(3);

Node node4 = new Node(4);

Node node5 = new Node(5);

node1.next = node3;

node3.next = node5;

node2.next = node4;

//        Node node = mergeTwoList(node1, node2);

Node node = mergeTwoList2(node2, node1);

while (node != null) {

System.out.print(node.data + " ");

node = node.next;

}

}

}

运行结果