计蒜客：顺序合并两个非有序的链表（Java实现）

1->2->3.
1->0->2.

1->1->0->2->2->3->NULL

import java.util.Scanner;

public class Main {

	static StringBuilder s = new StringBuilder();

	public static void main(String[] args) {
		core();
	}

	public static void core() {
		Scanner sc = new Scanner(System.in);
		String s1 = sc.nextLine();
		String s2 = sc.nextLine();
		sc.close();
		String[] str1 = s1.substring(0, s1.length() - 1).split("->");
		String[] str2 = s2.substring(0, s2.length() - 1).split("->");
		int minlength = str1.length < str2.length ? str1.length : str2.length;
		int maxlength = str1.length > str2.length ? str1.length : str2.length;
		for (int i = 0; i < minlength; i++) {
			if (Integer.parseInt(str1[i]) < Integer.parseInt(str2[i])) {
				s.append(str1[i] + "->");
				s.append(str2[i] + "->");
			} else {
				s.append(str2[i] + "->");
				s.append(str1[i] + "->");
			}
		}
		if (minlength == maxlength) {
			System.out.println(s.append("NULL"));
		}else {
			for(int i=minlength;i");
				}else {
					s.append(str2[i] + "->");
				}
			}
			System.out.println(s.append("NULL"));
		}
	}
}