| Question | Answer |
| Remove duplicate nodes from linked list of integers while keeping only the first occurrence of duplicates. | /** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */ class Solution { public ListNode deleteDuplicates(ListNode head) { if(head == null) return head; ListNode temp = head; while(temp != null ){ if(temp.next == null){ break; } ListNode next = temp.next; if(temp.val == next.val){ temp.next = next.next; }else{ temp = temp.next; } } return head; } } |
Want to create your own Flashcards for free with GoConqr? Learn more.