合成两个排序的链表（25）

题目：输入两个递增排序的链表，合并这两个链表并使新链表中的结点仍然是按照递增排序的。

public class Offer25 {

  public static Node25 Merge(Node25 list1, Node25 list2) {
    Node25 head;
    if (list1 == null) {
      return list2;
    }
    if (list2 == null) {
      return list1;
    }
    if (list1.val < list2.val) {
      head = list1;
      head.next = Merge(list1.next, list2);
    } else {
      head = list2;
      head.next = Merge(list1, list2.next);
    }
    return head;
  }

  public static void main(String[] args) {
    Node25 left = new Node25(1);
    left.next = new Node25(3);
    //left.next.next = new Node25(5);
    Node25 right = new Node25(2);
    right.next = new Node25(4);
    //right.next.next = new Node25(6);
    Node25 head  = Merge(left,right);
    System.out.println(head);
  }



}

class Node25 {
  public int val;

  public Node25 next;

  public Node25(int val) {
    this.val = val;
  }
}