I can only write code within the white boundaries, so I can only edit the Linked

Question

I can only write code within the white boundaries, so I can only edit the LinkedListNode method and none of the ones in pink, nor can I add any new methods.

We define a redundant node in a singly-linked list to be a node w data value matches with the data value of a previous node in the list. In other words, given node node containing data value ai some node nodej (where i i) having data value d is redundant if hose di d. For example, consider the following linked list with one redundant node A zero indexed list in the form list 13, 4, 3, with a redundant node at index 2. Complete the distinct functiun in the rditor below. It has Curie paranneler: a Linkedi isINode, h referencing the first de linked list of integers. The function must return a LinkRdlistwode referen g the first node nfa list thatCOrtains only the non- redundant no des from the original list (and none of the redundant ones). All non-redundant nodes must be in the same exact order as they were in the original list. Input Format The first line oonlains an integrer, n, denpling line number of elements in list. Fach line inf the n subsequent lines (where si

Explanation / Answer

Read my Note at bottom first please

import java.util.HashMap; //Please add Import also ,We can add it no worries

static LinkedListNode distinct(LinkedListNode head) {

  HashMap<Integer,Integer> map=new HashMap<Integer,Integer>();

if(head==null)
return null;
LinkedListNode current=head.next;
LinkedListNode previous=head;
map.put(head.val,0);
while(current!=null) {
if(map.containsKey(current.val)) {
previous.next=current.next;
current=current.next;
}
else {
map.put(current.val,0);
  previous=current;
  current=current.next;
}
}
return head;
}

======================

NOTE :

First Try without import, If it doesnt work or says HashMap not found, then you need to add import


If there is any issue, let me know I will change it and make it work..definitely


Thanks

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.