Question

Problem 1 Given a linked list of integers, write a function getUnique that removes all duplicates elements in the linked list and returns the new linked list of unique elements (The order does not matter). Example: Input: 1-»2->3->1-2 Output: 1->2->3 public class Node f int iterm Node next; Node(int d) t item = d; next-null; ) import java.util.ArrayList; public class ExtraLab public static void main (String[] args)t PROBLEM 1 System.out.println("PROBLEM 1"); Node head new Node(1); head.next-new Node (2); head.next.next-new Node(3); head.next.next.next-new Node (1); head.next.next.next.next-new Node(2); head = getUnique(head); printLinkedList (head); PROBLEM 2 System.out.println("PROBLEM 2"); string str= "I like queues but queues do not like me"; ArrayList toIgnore new ArrayList); toIgnore.add("stacks"); System.out.println(getMostCommonword(str, toIgnore)); // should return "like" PROBLEM 3 System.out.println("PROBLEM 3"); str-"CSC2720" System.out.printin(findUnique Index(str)); /I Should return 1 str-"toto"; System.out.println(findUniqueIndex(str)); /I Should return -1 public static Node getUnique (Node head) / PROBLEM 1: INSERT CODE HERE return null; public static int findUniqueIndex (String str) // PROBLEM 2: INSERT CODE HERE return 0; public static String getMostCommonword (String str, ArrayList list) // PROBLEM 3: INSERT CODE HERE return null; public static void printLinkedList (Node head) for(Node cur head;cur!-null;cur-cur.next) System.out.print (cur.itemt" "; System.out.println);

Answer 1

import java.util.*;

class Node{
   int item;
   Node next;
  
   Node(int d){
       item = d;
       next = null;
   }
  
}

public class ExtraLab{
  
   public static void main(String[] arg) {
       System.out.println("PROBLEM 1");
      
       Node head = new Node(1);
       head.next = new Node(2);
head.next.next = new Node(3);  
head.next.next.next = new Node(1);  
head.next.next.next.next = new Node(2);  
printLinkedList(head);
head = getUnique(head);
printLinkedList(head);
  

   }

   public static void printLinkedList(Node head) {
       for(Node cur = head; cur != null; cur = cur.next) {
           System.out.println(cur.item+" ");
       }
       System.out.println();
   }

   public static Node getUnique(Node head) {
      
       if(head==null){
   return null;
   }
      
       HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
  
   Node currNode = head.next;
   Node prevNode = head;
   Node temp;
   map.put(head.item, 1);
  
   while(currNode!=null){
   int data = currNode.item;
   if(map.containsKey(data)){
   prevNode.next = currNode.next;
   temp= currNode;
   currNode = currNode.next;
   temp.next = null;
   }else{
       map.put(data, 1);
   prevNode = currNode;
   currNode = currNode.next;
   }
}

return head;
}
}

D ExtraLab,java 3 39 public static Node getUnique (Node head) if(head--null) return null; HashMap< Integer, Integer> HashMap<Integer, Integer>(); map = new Node currNode = head . next; Node prevNode = head; Node temp; map. put (head.item, 1); 7 9 50 while(currNodel-null) int data-= currNode. item; if(map. containsKey(data)){ 54 prevNode.next = currNode.next; 貝Console <terminatedExtLab [Java Application] C\Program FilesUavajre1.8.0 181 bin\javaw.exe (Apr 28, 2019, 11:53:48 AM) PROBLEM 1