How does LeetCode delete duplicate elements in a sorted linked list
This article mainly introduces LeetCode how to delete the repeated elements in the sorted list, which has a certain reference value, interested friends can refer to, I hope you can learn a lot after reading this article, let the editor take you to understand it.
0x01, brief description of the problem
Given a sorted linked list, delete all duplicate elements so that each element appears only once.
0x02, exampl
Example 1:
Input: 1-> 1-> 2 output: 1-> 2 example 2:
Input: 1-> 1-> 2-> 3-> 3 output: 1-> 2-> 3
0x03, ideas for problem solving
Operation of linked list, iterative operation
0x04, problem solving procedure
Public class DeleteDuplicatesTest {public static void main (String [] args) {ListNode L1 = new ListNode (1); ListNode L2 = new ListNode (1); ListNode L3 = new ListNode (2); l1.next = 12; l2.next = L3; ListNode listNode = deleteDuplicates (L1); System.out.println ("listNode =" + listNode)
}
Public static ListNode deleteDuplicates (ListNode head) {if (head = = null) {return null;} if (head.next = = null) {return head;} ListNode tempNode = head; while (tempNode.next! = null) {if (tempNode.val = = tempNode.next.val) {tempNode.next = tempNode.next.next } else {tempNode = tempNode.next;}} return head;}}
0x05, photo version of the problem solving program
Thank you for reading this article carefully. I hope the article "how to remove the repetitive elements in the sorted list" shared by the editor will be helpful to everyone. At the same time, I also hope that you will support and pay attention to the industry information channel. More related knowledge is waiting for you to learn!
