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

7 votes246 views2 answers
C# guid from string
C#
0 vote287 views1 answer
How to parse mongo db json in c#
C#
0 vote184 views1 answer
You are trying to create a MonoBehaviour using the 'new' keyword.
C#
30 votes198 views3 answers
How to create a list in c# unity
C#
13 votes185 views1 answer
What does static mean in c#
C#
0 vote227 views1 answer
Read administrator account remote machine C#
C#
0 vote208 views1 answer
How to twist a image in the code behind C#
C#
0 vote239 views1 answer
C# get all letters
C#
0 vote227 views2 answers
How to add serilog to your asp.net project
C#
2 votes187 views1 answer
C# empty IEnumerable
C#