Breaking News: Grepper is joining You.com. Read the official announcement!

Find merge point of two linked list using Scala

Sumit Rawal answered on August 28, 2023 Popularity 1/10 Helpfulness 1/10

answer Find merge point of two linked list using Scala

Find merge point of two linked list using Scala

Comment

class ListNode(var value: Int, var next: ListNode)

object LinkedListUtils {
  def findMergePoint(headA: ListNode, headB: ListNode): Option[ListNode] = {
    var currA = headA
    var currB = headB

    while (currA != currB) {
      currA = if (currA == null) headB else currA.next
      currB = if (currB == null) headA else currB.next
    }

    Option(currA) // Return the merge point or None if no merge point exists
  }
}

object Main extends App {
  val commonNode = new ListNode(7, null)
  
  val listA = new ListNode(3, new ListNode(1, commonNode))
  val listB = new ListNode(5, new ListNode(9, new ListNode(2, commonNode)))
  
  val mergePoint = LinkedListUtils.findMergePoint(listA, listB)
  
  mergePoint match {
    case Some(node) => println(s"Merged at node with value ${node.value}")
    case None => println("No merge point found")
  }
}

Popularity 1/10 Helpfulness 1/10 Language scala

Source: chat.openai.com

Tags: find linked-list merge point scala using

Link to this answer
Share Copy Link

Contributed on Aug 28 2023

Sumit Rawal

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

Find merge point of two linked list using Scala

Contents

More Related Answers

Find merge point of two linked list using Scala

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.