Question: Write a java method for a linked list: public void shift ( ) . This method will rearrange the elements of a list of integers

Write a java method for a linked list: public void shift(). This method will rearrange the elements of a list of integers by moving to the end of the list all values that are in odd-numbered positions and otherwise presern; what matters is whether the value appears in an odd index (index 1,3,5, etc.). Also, the original order of the elements of the list should otherwise be preserved. You may not construct any new nodes nor use any auxiliary data structures to solve this problem. You also may not change any data fields of the nodes; you MUST solve this problem by rearranging the links of the list. For example, suppose that a variable list stores the values [10,31,42,23,44,75,86]. The call of list.shift() should rearrange the list to store [10,42,44,86,31,23,75].
There were something wrong with my codes:
public void shift(){
//we are storing second node in prev because we wrote diffrent logic for first node in first if condition
ListNode previous = front.next;
for (int i=1; i<=this.size(); i++){
if (i ==1){// logic for first node
ListNode temp_node = front; // storing first node
ListNode current = front;
front = current.next;
while (current.next != null){
current = current.next; // going to add node of list
}
temp_node.next = null; // before adding node make next of node null because it will be added at last now
current.next = temp_node; // adding first node at last
}
else if (i %2==1){// logic for nodes other than first node
ListNode current = front;
ListNode temp_node = previous.next; // this is the odd number node which we will add at last
previous.next = temp_node.next; // now linking the prev node to the next of odd index node.
previous = temp_node.next; // now storing the prev node as the next of odd index node which we will add at last
while (current.next != null){
current = current.next; // going to last node of list
}
temp_node.next = null; // making next of node as null before being added at last
current.next = temp_node; // now adding at last
}
}// end of for loop
}// end shift method

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!

Q:

I already asked this question so this was the code I submitted for the MyLinkedList.java but I keep getting this error: zyLabsUnitTest.java:6: error: MyLinkedList is abstract; cannot be instantiated...

Q:

The Assignment 1)Please describe the function of the following methods add(), deleteMin(), and size() that are supported by the priority queue interface. 2)Implement those methods using a...

Q:

Java HW Please MUST use the design I give Modify the MagazineRack program presented in Chapter 12(13) by reading magazines from a file AND having the user enter magazines. Also, add delete, deleteAll...

Q:

Program Behavior In this assignment, you'll implement classes that analyze tweets and present analysis results to users. This analysis will be driven by two classes that work in tandem to read in...

Q:

Linked lists are an important, but tricky topic in computer science. What I have tried to do with this code is show you how linked lists works, while also demonstrating how using classes and helper...

Q:

Hi, I'm having a really tough time with writing Simulation. java. All the files needed for the assignment are in the instructions below, including example input ex1 and example outputs ex1.rpt and...

Q:

1) Write a Java method called swap to swap two nodes x and y (and not just their contents) in a doubly linked list L given references only to x and y. You need to change links in nodes x, y, and...

Q:

1. Write a Java method called swap to swap two nodes x and y (and not just their contents) in a doubly linked list L given references only to x and y. You need to change links in nodes x, y, and...

Q:

Any assistance with this would be greatly appreciated. 1. Write a Java method called swap to swap two nodes x and y (and not just their contents) in a doubly linked list L given references only to x...

Q:

MyArrayList.Java: // Complete the implementation of your MyArrayList class in this file public class MyArrayList implements MyList { // Implement the required fields and methods here // Do not alter...

Q:

You are a manager of a Wally's Training Gym and you encourage your trainers to enroll new members. Input is the trainer's last name and the number of new enrollees. Output is the number of trainers...

Q:

A hydraulic cylinder of area 0.01 m2 must push a 1000 kg arm and shovel 0.5 m straight up. What pressure is needed and how much work is done?

Q:

Which of the following is / are considered monetary rewards and incentives? Rebates All of these choices Gift cards Price adjustments

Q:

Details AV Overview: This final project is the cornorstone of this course. The purpose of this project is to provide students the opportunity to demonstrate their cor:prehension of the s