Leetcode 86. Partition List (链表好题)

  1. Partition List
    Medium

Given the head of a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.

You should preserve the original relative order of the nodes in each of the two partitions.

Example 1:

Input: head = [1,4,3,2,5,2], x = 3

Output: [1,2,2,4,3,5]

Example 2:

Input: head = [2,1], x = 2

Output: [1,2]

Constraints:

The number of nodes in the list is in the range [0, 200].

-100 <= Node.val <= 100

-200 <= x <= 200

解法1:

注意不能直接用node=node->next。

复制代码
        ListNode *tmp = node->next;
        //node = node->next;
        node->next = NULL;
        node = tmp;

以 [1,4,3,2,5,2] 为例,5后面是2,如果不断开,就会形成环。

cpp 复制代码
/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    ListNode* partition(ListNode* head, int x) {
        ListNode *dummy1 = new ListNode(0), *dummy2 = new ListNode(0);
        ListNode *node1 = dummy1, *node2 = dummy2, *node = head;
        while (node) {
            if (node->val < x) {
                node1->next = node;
                node1 = node1->next;
            } else {
                node2->next = node;
                node2 = node2->next;
            }
            ListNode *tmp = node->next;
            //node = node->next;
            node->next = NULL;
            node = tmp;
        }
        node1->next = dummy2->next;
        ListNode *res = dummy1->next;
        delete(dummy1); delete(dummy2);
        return res;
    }
};
相关推荐
爱编程的化学家24 分钟前
代码随想录算法训练营第十一天--二叉树2 || 226.翻转二叉树 / 101.对称二叉树 / 104.二叉树的最大深度 / 111.二叉树的最小深度
数据结构·c++·算法·leetcode·二叉树·代码随想录
吃着火锅x唱着歌1 小时前
LeetCode 1446.连续字符
算法·leetcode·职场和发展
愚润求学1 小时前
【贪心算法】day10
c++·算法·leetcode·贪心算法
Tisfy2 小时前
LeetCode 0966.元音拼写检查器:三个哈希表实现
leetcode·字符串·散列表·题解·哈希表
ゞ 正在缓冲99%…3 小时前
leetcode35.搜索插入位置
java·算法·leetcode·二分查找
YuTaoShao4 小时前
【LeetCode 每日一题】36. 有效的数独
linux·算法·leetcode
吃着火锅x唱着歌4 小时前
LeetCode 2110.股票平滑下跌阶段的数目
数据结构·算法·leetcode
小猪咪piggy6 小时前
【算法】day2 双指针+滑动窗口
数据结构·算法·leetcode
hn小菜鸡15 小时前
LeetCode 3643.垂直翻转子矩阵
算法·leetcode·矩阵
YuTaoShao17 小时前
【LeetCode 每日一题】3000. 对角线最长的矩形的面积
算法·leetcode·职场和发展