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 vote318 views1 answer
Devexpress spreadsheet document source wpf
C#
0 vote325 views1 answer
Visual studio console clear
C#
1 vote402 views1 answer
Unity add addressables
C#Unity
0 vote328 views1 answer
C# print all properties of an object including children objects
C#
6 votes346 views2 answers
Left moust click unity
C#Unity
8 votes338 views2 answers
Float to int c#
C#
0 vote322 views1 answer
Real world example of sinleton design pattern
C#
0 vote304 views1 answer
Sort array dotnet
C#
0 vote320 views1 answer
C# use hashtable check if key exists
C#
0 vote327 views1 answer
Reverse for loop unity
C#