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

1 vote178 views1 answer
C# function return datareader
C#
1 vote170 views1 answer
C# find element by condition
C#
1 vote169 views1 answer
Backcolor c# hexadecimal
C#
1 vote232 views2 answers
Delegates in UnityC#
C#Unity
0 vote134 views1 answer
Dropdown text
C#
0 vote177 views1 answer
Firepower 4125 License update
C#
6 votes191 views2 answers
How to check if textbox is empty in c#
C#
0 vote182 views1 answer
LINQ: 2 join with group by
C#
0 vote183 views1 answer
If exist request c#
C#
45 votes202 views6 answers
Random number generator unity
C#