极客时间架构师训练营 - week8 - 作业 1

package jjn;
import java.util.Objects;
import java.util.StringJoiner;
/**
 * @author Jiang Jining
 * @date 2020/7/29 21:54
 */
public class Node {
    private Integer index;
    private String value;
    public Node() {
    }
    public Integer getIndex() {
        return index;
    }
    public void setIndex(Integer index) {
        this.index = index;
    }
    public String getValue() {
        return value;
    }
    public void setValue(String value) {
        this.value = value;
    }
    @Override
    public boolean equals(Object o) {
        if (this == o) return true;
        if (o == null || getClass() != o.getClass()) return false;
        Node node = (Node) o;
        return Objects.equals(value, node.value);
    }
    @Override
    public int hashCode() {
        return Objects.hash(value);
    }
    @Override
    public String toString() {
        return new StringJoiner(", ", Node.class.getSimpleName() + "[", "]")
                .add("index=" + index)
                .add("value='" + value + "'")
                .toString();
    }
}

package jjn;
import java.util.*;
/**
 * @author Jiang Jining
 * @date 2020/7/29 21:54
 */
public class LinkListTest {
    public static void main(String[] args) {
        List<Node> listA = new LinkedList<>();
        List<Node> listB = new LinkedList<>();
        for (int i = 0; i < 10; i++) {
            Node randomNode = getRandomNode(i);
            listA.add(randomNode);
        }
        for (int i = 0; i < 15; i++) {
            Node randomNode = getRandomNode(i);
            listB.add(randomNode);
        }
        System.out.println("listA:");
        listA.forEach(System.out::println);
        System.out.println("listB:");
        listB.forEach(System.out::println);
        Node mergingNode = getMergingNode(listA, listB);
        if (mergingNode == null) {
            System.out.println("两个链表无合并");
        } else {
            System.out.println("合并的元素是:" + mergingNode);
        }
    }
    private static Node getRandomNode(int index) {
        Node node = new Node();
        node.setIndex(index);
        node.setValue((char) (Math.random() * 26 + 'A') + "");
        return node;
    }
    private static Node getMergingNode(List<Node> listA, List<Node> listB) {
        if (listA == null || listB == null) {
            return null;
        }
        Set<Node> nodes = new HashSet<>(listA.size());
        nodes.addAll(listA);
        for (Node node : listB) {
            if (nodes.contains(node)) {
                return node;
            }
        }
        return null;
    }
}