/C#/Check if two linked lists merge. If so, where?

Check if two linked lists merge. If so, where?

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 vote186 views1 answer
Deleting an item from a vector c#
C#
0 vote168 views1 answer
Linq get a dictionary key and value c#
C#
1 vote191 views2 answers
Should i learn c #
C#
0 vote134 views1 answer
C# razor add disabled to button if
C#
14 votes191 views3 answers
C# print array
C#
4 votes169 views2 answers
Group by linq multiple columns C#
C#
16 votes174 views10 answers
How to code
C#
1 vote173 views1 answer
C# enum check in string value
C#
4 votes201 views1 answer
C# create DataTable
C#
8 votes190 views2 answers
C# add string to array
C#