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

1 vote128 views2 answers
For statement syntax C sharp
C#
0 vote136 views1 answer
DataTable GetErrors
C#
0 vote133 views1 answer
C# unhandled exception in thread”
C#
1 vote160 views1 answer
C# unity control key input
C#Unity
0 vote129 views1 answer
C# insert from with bind array
C#
2 votes126 views3 answers
Sequelize count all
C#
2 votes122 views2 answers
C# get wifi ip address
C#
0 vote131 views1 answer
Even configuration custom errors page is not working asp.net MVC
C#
0 vote130 views1 answer
Select every second row in html table
C#
0 vote170 views1 answer
Ms transform
C#