Solving joeshpus problem in java using doubly circular linked list

Question

0.00/5 (No votes)

See more:

how to retain all deteled nodes and restore the list in same state as it was before ?

What I have tried:

I have tried using stack to store all deleted items while deleting but dont know is it right approach or not.

Java

public static String josephus(int m) {
Node ptr1 = start, ptr2 = start;
if (m > size) {
throw new LinkedListException("No element left to remove");
}

while (ptr1.next != ptr1) {

// Find m-th node
int count = 1;
while (count != m) {
ptr2 = ptr1;
ptr1 = ptr1.next;
count++;
}

/* Remove the m-th node */
System.out.println("Removing item : " + ptr1.data);
stack.push(ptr1.data);
ptr2.next = ptr1.next;
ptr1 = ptr2.next;
}

return ptr1.data;
}

public static void setOriginal(int m) {
Node ptr1 = start;
while (!stack.isEmpty() && ptr1.next != ptr1) {

// Find m-th node
int count = 1;
while (count != m) {
ptr1 = ptr1.next;
count++;
}

ptr1.data = stack.pop();
//System.out.println(ptr1.item);
}
}

Posted 11-Nov-20 20:30pm

Aarsh Modi

Updated 11-Nov-20 23:37pm

CPallini

v2

Add a Solution

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

CPallini · Answer 1 · 2020-11-11T23:15:00

Solution 1

Quote:
I have tried using stack to store all deleted items while deleting but dont know is it right approach or not

You can experimentally establish that: check your results against the original list.

(Or post here your code, otherwise the question makes poor sense).

Posted 11-Nov-20 23:15pm

CPallini

Comments

Aarsh Modi 12-Nov-20 5:28am

public static String josephus(int m) {
Node ptr1 = start, ptr2 = start;
if (m > size) {
throw new LinkedListException("No element left to remove");
}

while (ptr1.next != ptr1) {

// Find m-th node
int count = 1;
while (count != m) {
ptr2 = ptr1;
ptr1 = ptr1.next;
count++;
}

/* Remove the m-th node */
System.out.println("Removing item : " + ptr1.data);
stack.push(ptr1.data);
ptr2.next = ptr1.next;
ptr1 = ptr2.next;
}

return ptr1.data;
}

public static void setOriginal(int m) {
Node ptr1 = start;
while (!stack.isEmpty() && ptr1.next != ptr1) {

// Find m-th node
int count = 1;
while (count != m) {
ptr1 = ptr1.next;
count++;
}

ptr1.data = stack.pop();
//System.out.println(ptr1.item);
}
}