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

2 votes228 views2 answers
Asp.net core url parameter
C#
0 vote231 views1 answer
C# if statement no braces
C#
0 vote172 views1 answer
Remove multiple element on list from index a to b C#
C#
0 vote156 views1 answer
Generate Prime Numbers
C#
7 votes221 views3 answers
Add two numbers in c#
C#
0 vote161 views1 answer
How to hide cell in epplus
C#
0 vote210 views1 answer
Scale min max to 0 1
C#
57 votes514 views6 answers
Unity find objects with tag
C#Unity
0 vote184 views1 answer
How to join array indexes with comma in c#
C#
8 votes155 views3 answers
C# increment by 1
C#