Completepublic class Solution { public static LinkedListNode<Integer> findPrevNode(LinkedListNode<Integer> head, int count) { for (int i=0;i<count-1;i++) { head=head.next; } return head; } public static LinkedListNode<Integer> swapNodes(LinkedListNode<Integer> head, int i, int j) { //Your code goes here if (head==null) { return head; } else if (j==0 || (i-j==-1)) { int temp=i; i=j; j=temp; } LinkedListNode<Integer> swap1=null,swap2=null,p1=null,n1=null,p2=null,n2=null; if (i==0 && i-j==1) { swap1=head; swap2=head.next; swap1=swap1.next; head=swap2; swap2.next=swap1; } else if(i-j==1) { p1=findPrevNode(head,j); swap1=p1.next; swap2=swap1.next; n2=swap2.next; //System.out.println(p1.data); //System.out.println(swap1.data); //System.out.println(swap2.data); //System.out.println(n2.data); p1.next=swap2; swap2.next=swap1; swap1.next=n2; } else if (i==0) { swap1=head; n1=swap1.next; p2=findPrevNode(head,j); swap2=p2.next; n2=swap2.next; head=swap2; head.next=n1; p2.next=swap1; swap1.next=n2; } else { p1=findPrevNode(head,i); p2=findPrevNode(head,j); swap1=p1.next; swap2=p2.next; n1=swap1.next; n2=swap2.next; p1.next=swap2; p2.next=swap1; swap1.next=n2; swap2.next=n1; } return head;.

The code defines a class Solution that contains two methods: findPrevNode and swapNodes.The…

Answered: public static LinkedListNode…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Concept explainers

Question

Complete

public class Solution {


	public static LinkedListNode<Integer> findPrevNode(LinkedListNode<Integer> head, int count)
	{
	for (int i=0;i<count-1;i++)
	{
	head=head.next;
	}
	return head;
	}

	public static LinkedListNode<Integer> swapNodes(LinkedListNode<Integer> head, int i, int j) {
	//Your code goes here
	if (head==null)
	{
	return head;
	}
	else if (j==0 \|\| (i-j==-1))
	{
	int temp=i;
	i=j;
	j=temp;
	}

	LinkedListNode<Integer> swap1=null,swap2=null,p1=null,n1=null,p2=null,n2=null;

	if (i==0 && i-j==1)
	{
	swap1=head;
	swap2=head.next;

	swap1=swap1.next;
	head=swap2;
	swap2.next=swap1;

	}
	else if(i-j==1)
	{
	p1=findPrevNode(head,j);
	swap1=p1.next;
	swap2=swap1.next;
	n2=swap2.next;
	//System.out.println(p1.data);
	//System.out.println(swap1.data);
	//System.out.println(swap2.data);
	//System.out.println(n2.data);

	p1.next=swap2;
	swap2.next=swap1;
	swap1.next=n2;

	}
	else if (i==0)
	{
	swap1=head;
	n1=swap1.next;
	p2=findPrevNode(head,j);
	swap2=p2.next;
	n2=swap2.next;

	head=swap2;
	head.next=n1;
	p2.next=swap1;
	swap1.next=n2;

	}
	else
	{
	p1=findPrevNode(head,i);
	p2=findPrevNode(head,j);
	swap1=p1.next;
	swap2=p2.next;
	n1=swap1.next;
	n2=swap2.next;

	p1.next=swap2;
	p2.next=swap1;
	swap1.next=n2;
	swap2.next=n1;
	}


	return head;.

Expert Solution

Step by step

Solved in 3 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions