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 vote119 views2 answers
Docker-compose cassandra db
C#
0 vote152 views1 answer
Unity get camera
C#Unity
0 vote77 views1 answer
C# itext 7 PdfDocument from byte array
C#
1 vote112 views1 answer
C# measure execution time
C#
2 votes104 views2 answers
Linq pick random element
C#
10 votes134 views3 answers
Unity C# instantiate prefab
C#Unity
0 vote105 views1 answer
String reduction in c#
C#
0 vote106 views1 answer
Netlifycms disable preview
C#
0 vote107 views1 answer
Elasticsearch nested aggregation in c#
C#
0 vote102 views1 answer
Accord.io read .mat file
C#