在Java中合并两个排序的LinkedLists (使用默认的LinkedList类，而不是自定义类)

import java.util.LinkedList;

public class MergeSortedLists {
    public static LinkedList<Integer> mergeTwoLists(LinkedList<Integer> l1, LinkedList<Integer> l2) {
        LinkedList<Integer> result = new LinkedList<>();
        int i = 0, j = 0;

        while (i < l1.size() && j < l2.size()) {
            if (l1.get(i) <= l2.get(j)) {
                result.add(l1.get(i));
                i++;
            } else {
                result.add(l2.get(j));
                j++;
            }
        }

        while (i < l1.size()) {
            result.add(l1.get(i));
            i++;
        }

        while (j < l2.size()) {
            result.add(l2.get(j));
            j++;
        }

        return result;
    }

    public static void main(String[] args) {
        LinkedList<Integer> l1 = new LinkedList<>();
        l1.add(1);
        l1.add(3);
        l1.add(5);

        LinkedList<Integer> l2 = new LinkedList<>();
        l2.add(2);
        l2.add(4);
        l2.add(6);

        LinkedList<Integer> mergedList = mergeTwoLists(l1, l2);
        System.out.println(mergedList); // 输出: [1, 2, 3, 4, 5, 6]
    }
}