An example Analysis of the split linked list of leetcode linked list
This article mainly introduces the example analysis of the split linked list of leetcode linked list, which has a certain reference value, and interested friends can refer to it. I hope you will gain a lot after reading this article.
The program divides the linked list on the basis of x, so that all nodes less than x are ranked before those greater than or equal to x. If the linked list contains xMagol x, it only needs to appear after the element less than x (as shown below). The split element x only needs to be in the "right half", and it does not need to be placed between the left and right parts. Example: input: head = 3-> 5-> 8-> 5-> 10-> 2-> 1, x = 5 output: 3-> 1-> 2-> 10-> 5-> 5-> 8 Source: LeetCode link: https://leetcode-cn.com/problems/partition-list-lcci copyright belongs to the collar buckle network. For commercial reprint, please contact official authorization. For non-commercial reprint, please indicate the source. Answer the question / Definition for singly-linked list. * public class ListNode {* int val; * ListNode next; * ListNode (int x) {val = x;} *} * / class Solution {public ListNode partition (ListNode head, int x) {ListNode cursor = head; ListNode previous = head; int tmp; while (cursor! = null) {if (cursor.val < x) {tmp = cursor.val Cursor.val = previous.val; previous.val = tmp; previous = previous.next;} cursor = cursor.next;} return head }} Thank you for reading this article carefully. I hope the article "sample Analysis of split linked lists of leetcode linked lists" shared by the editor will be helpful to you. At the same time, I also hope that you will support us and pay attention to the industry information channel. More related knowledge is waiting for you to learn!
