1- A new static method with one parameter which is a head node for a linked list of integers, the method should create a new linked list which is equivalent to the original list of integers but with all repetitions removed, the method's return value is a head reference for the new list.     this is what I have but it's not removing repetitions.         public static IntLinkedBag removeRepetition (IntLinkedBag b1) {          IntNode next;        IntNode head = null;        LinkedList s = new LinkedList<>();          IntNode new_list = new IntNode(0, null);        IntNode now = head;        IntNode prev = new_list;        while (now!= null) {            int x = now.data;              if (s.contains(x)) {                new_list = new_list.next;            }            else {                 s.add(x);                new_list.next =  new IntNode(x, now);                new_list = new_list.next;        }            now = now.next;        }          return b1;    } }     Subject: Java Programming

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
icon
Related questions
Question

1- A new static method with one parameter which is a head node for a linked list of integers, the method should create a new linked list which is equivalent to the original list of integers but with all repetitions removed, the method's return value is a head reference for the new list.

 

 

this is what I have but it's not removing repetitions.  

 

 

 

public static IntLinkedBag removeRepetition (IntLinkedBag b1) {

 

       IntNode next;

       IntNode head = null;

       LinkedList<Integer> s = new LinkedList<>();

 

       IntNode new_list = new IntNode(0, null);

       IntNode now = head;

       IntNode prev = new_list;

       while (now!= null) {

           int x = now.data;

 

           if (s.contains(x)) {

               new_list = new_list.next;

           }

           else { 

               s.add(x);

               new_list.next =  new IntNode(x, now);

               new_list = new_list.next;

       }

           now = now.next;

       }

 

       return b1;

   }

}

 

 

Subject: Java Programming

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education