架构师训练营第八周作业

// Node elements constitue listtype Node struct {	value int	next  *Node}
// CheckFirstCommnality CheckFirstCommnality checks the first commanlity node between two lists, if no such node ,then returns nilfunc CheckFirstCommnality(m *Node, n *Node) *Node {	if m == nil || n == nil {		return nil	}
	// tailM points to the head of reversed list m	var tailM *Node = nil	for p := m; p != nil; {		r := &Node{p.value, tailM}		tailM = r		p = p.next	}
	// tailN points to the head of reversed list n	var tailN *Node = nil	for p := n; p != nil; {		r := &Node{p.value, tailN}		tailN = r		p = p.next	}
	var commnality *Node = nil	for rm, rn := tailM, tailN; rm != nil && rn != nil && rm != rn; {		commnality = rm		rm = rm.next		rn = rn.next	}
	return commnality}