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 vote178 views1 answer
C# split on multiple characters
C#
0 vote177 views1 answer
How to set a tag in asp net razor view stackoverflow
C#
0 vote195 views1 answer
How to coppy a portion of an array in c#
C#
0 vote206 views1 answer
How to concatenate two arrays
C#
0 vote243 views4 answers
Badlion
C#
1 vote203 views1 answer
C sharp stream to byte array
C#
7 votes181 views1 answer
Convert system.byte a string c#
C#
2 votes185 views1 answer
C# mysql query
C#
0 vote166 views1 answer
Unity stop physics
C#
0 vote178 views1 answer
C# test if char is alpha
C#