Merge point

int FindMergeNode(Node headA, Node headB) {
  Node currentA = headA;
  Node currentB = headB;

  // Do till the two nodes are the same
  while (currentA != currentB) {
    // If you reached the end of one list start at the beginning of the other
    // one currentA
    if (currentA.next == null) {
      currentA = headA;
    } else {
      currentA = currentA.next;
    }
    // currentB
    if (currentB.next == null) {
      currentB = headB;
    } else {
      currentB = currentB.next;
    }
  }
  return currentB.data;
}

Source: stackoverflow.com

Similar codes

0 vote144 views1 answer
Windows forms webbrowser goback
C#
0 vote150 views1 answer
C# file watcher specific file
C#
1 vote182 views1 answer
Slider.onchanged in unity
C#
0 vote123 views1 answer
How to concert a list into strinf splitted by coma c#
C#
-2 votes142 views1 answer
C# list max
C#
2 votes141 views1 answer
Play a sound c#
C#
0 vote152 views1 answer
C# add key value pair to dictionary
C#
8 votes150 views1 answer
Lockstate untiy
C#
0 vote271 views1 answer
Import tachyons in react
C#
0 vote134 views1 answer
Top down movement unity
C#