Merge Sorted Linked Lists java

justformyntra8 · May 23, 2019, 5:45pm

I’m getting the correct answer, but it is not accepting all the test cases.
I can’t even access the test cases and editorial.

Riyabansal98 · May 24, 2019, 6:28am

Hi Aman

Please share the link to your code.

justformyntra8 · May 24, 2019, 7:40am

github.com

bhardwaj-aman/java-data-structures-practice-questions/blob/master/mergesortedlinkedlists

import java.util.*;
class LinkedList {

	private class Node {

		int data;
		Node next;
	}

	private Node head;
	private Node tail;
	private int size;

	public int getFirst() throws Exception {
		if (this.size == 0)
			throw new Exception("linked list is empty");

		return head.data;
	}

This file has been truncated. show original

Jaa18Crx0002 · May 24, 2019, 10:23am

Hi Aman,
Your code will not work in case where 1st element of a linked list is greater than 2nd element of other linked list. Such as
linked list 1: 1 2 3 4 5
linked list 2: 6 7 8 9 10

the correct output will be: 1 2 3 4 5 6 7 8 9 10
but your code will print: 1 6 2 7 3 8 4 9 5 10 which is wrong.

justformyntra8 · May 24, 2019, 3:17pm

that solved it - thank you

Riyabansal98 · May 25, 2019, 1:01pm

Hi Aman

I am marking your doubt as resolved. Please mark your doubts as resolved in your course’s “ Ask Doubt ” section, when your doubt is resolved.