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 vote155 views1 answer
C# razor add disabled to button if
C#
0 vote237 views3 answers
C# replace multiple characters
C#
1 vote171 views1 answer
C# check if list contains string case insensitive
C#
0 vote178 views1 answer
How to cut image from timeline editor in c#
C#
0 vote166 views1 answer
Throw index out of range C#
C#
0 vote162 views1 answer
Loop gridcontrol devexpress c#
C#
129 votes285 views6 answers
C# random generator
C#
0 vote181 views1 answer
Chrome devtools capture all styling an element uses
C#
0 vote218 views1 answer
Audio source pause unity
C#Unity
0 vote178 views4 answers
Custom attribute for auth permission check .net
C#