第八周·命题作业

public class LinkNode {
    String text;
    LinkNode next;
    public LinkNode(String txt,LinkNode next) {
        this.text = txt;
        this.next = next;
    }
}

  public static void main(String[] args) {
        LinkNode linkMerge = new LinkNode("x", new LinkNode("y", new LinkNode("z", null)));
        LinkNode link1 = new LinkNode("a", new LinkNode("b", linkMerge));
        LinkNode link2 = new LinkNode("d", new LinkNode("e", new LinkNode("f", linkMerge)));
        Set<Integer> hashCodeSet = new HashSet<>();
        while (link2 != null) {
            hashCodeSet.add(link2.hashCode());
            link2 = link2.next;
        }
        boolean isMerge = false;
        while (link1 != null) {
            if (hashCodeSet.contains(link1.hashCode())) {
                isMerge = true;
                break;
            }
            link1 = link1.next;
        }
        log.info("is merge:{}", isMerge);
        log.info("时间复杂度:{} | 空间复杂度:{}", "O(n)","O(n)");
    }