2链表问题--01打印两个有序列表的公共部分

最新推荐文章于 2020-08-22 07:46:16 发布

原创最新推荐文章于 2020-08-22 07:46:16 发布 · 430 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#链表

算法与数据结构题目最优解专栏收录该内容

8 篇文章

订阅专栏

本文介绍了一个Java程序，该程序能够找出并打印两个有序链表的公共元素。通过遍历两个链表并比较节点值，当遇到相同的值时则打印出来。此外，还提供了打印链表的方法。

package chapter_2_listproblem;

public class Problem_01_PrintCommonPart {

    public static class Node {//定义一个Node类
        public int value;
        public Node next;
        public Node(int data) {
            this.value = data;
        }
    }

    public static void printCommonPart(Node head1, Node head2) {
        System.out.print("Common Part: ");
        while (head1 != null && head2 != null) {
            if (head1.value < head2.value) {
                head1 = head1.next;
            } else if (head1.value > head2.value) {
                head2 = head2.next;
            } else {
                System.out.print(head1.value + " ");
                head1 = head1.next;
                head2 = head2.next;2
            }
        }
        System.out.println();
    }

    public static void printLinkedList(Node node) {
        System.out.print("Linked List: ");
        while (node != null) {
            System.out.print(node.value + " ");
            node = node.next;
        }
        System.out.println();
    }

    public static void main(String[] args) {
        Node node1 = new Node(2);
        node1.next = new Node(3);
        node1.next.next = new Node(5);
        node1.next.next.next = new Node(6);

        Node node2 = new Node(1);
        node2.next = new Node(2);
        node2.next.next = new Node(5);
        node2.next.next.next = new Node(7);
        node2.next.next.next.next = new Node(8);

        printLinkedList(node1);
        printLinkedList(node2);
        printCommonPart(node1, node2);

    }

}