课后作业 -week08

public Node getMergeNode(Node m,Node n){
		//分别遍历m,n的链表，判端m和n里是否有元素相等
    if(m == null && n == null) return null;
    Node nodeA = m;
    Node nodeB = n;
    while(nodeA != nodeB){
        nodeA = nodeA == null ? nodeB : nodeA.next();
        nodeB = nodeB == null ? nodeA : nodeB.next();
    } 
    return nodeA;
}