第八周作业

public class NodeLinked{
	private Node head;
	public void add(Node  node) {
		if (node != null) {
			addLast(node);
		}
	}
  void addLast(Node node) {
		if (head == null) {
			head = node;
		} else {
			head.next = node;
		}
	}
	public void foreach(Consumer<Node> c) {
		Node tmpNode = head;
		if (head != null) {
			do {
				c.accept(tmpNode);
			} while ((tmpNode = tmpNode.next) != null);
		}
	}
  
}
class Node {
		public Node next;
		public Node(Node next) {
			this.next = next;
		}
}
class Test{
		public static void main(String[] args) {
      LinkedDemo linkedOne = new LinkedDemo();
      LinkedDemo linkedTwo = new LinkedDemo();
      Node sharedNode = new Node();
      linkedOne.add(new Node());
      linkedOne.add(new Node());
      linkedOne.add(new Node());
      linkedOne.add(sharedNode);
      linkedTwo.add(new Node());
      linkedTwo.add(new Node());
      linkedTwo.add(sharedNode);
      Set<Node> nodeSet = new HashSet<Node>();
      linkedOne.foreach(nodeSet::add);
      linkedTwo.foreach(t ->{
        if(nodeSet.contains(t)) {
          System.out.println("sharedNode -> " + t);
        }
      });
		
	}
  
	
}