Merge point of two list

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 vote131 views1 answer
C# system dont let write txt file
C#
25 votes162 views2 answers
Time delay C# unity
C#Unity
2 votes164 views1 answer
Unity default rotation
C#Unity
5 votes118 views2 answers
C# datetime iso 8601 format
C#
96 votes208 views6 answers
String to int c#
C#
0 vote126 views2 answers
Winforms reportviewer.print report
C#
0 vote160 views1 answer
Download xml file asp.net web api
C#
0 vote127 views1 answer
Large blank file C#
C#
0 vote123 views1 answer
Muovere un elemento in c#
C#
0 vote110 views1 answer
Select distinct linq mvc
C#