Leetcode 725. Split Linked List in Parts

最新推荐文章于 2022-06-30 23:37:06 发布

Nahida_nora

最新推荐文章于 2022-06-30 23:37:06 发布

阅读量175

点赞数 1

分类专栏： Sort LinkedList Leetcode

本文链接：https://blog.csdn.net/weixin_43876597/article/details/106894684

版权

Leetcode 同时被 3 个专栏收录

98 篇文章 0 订阅

订阅专栏

Sort

9 篇文章 0 订阅

订阅专栏

LinkedList

2 篇文章 0 订阅

订阅专栏

Leetcode 725. Split Linked List in Parts

If there are N nodes in the linked list root, then there are N / k items in each part, plus the first N%k parts have an extra item.
有N个节点，前N%k个部分有 (N/k + N%k )个数字，其余有N/k。

Approach #1: Create New Lists [Accepted]

class Solution {
    public ListNode[] splitListToParts(ListNode root, int k) {
        ListNode cur = root;
        int N = 0;
        while (cur != null) {
            cur = cur.next;
            N++;
        }

        int width = N / k, rem = N % k;

        ListNode[] ans = new ListNode[k];
        cur = root;
        for (int i = 0; i < k; ++i) {
            ListNode head = new ListNode(0), write = head;
            for (int j = 0; j < width + (i < rem ? 1 : 0); ++j) {
                write = write.next = new ListNode(cur.val);
                if (cur != null) cur = cur.next;
            }
            ans[i] = head.next;
        }
        return ans;
    }
}

Approach #2: Split Input List [Accepted]

class Solution {
    public ListNode[] splitListToParts(ListNode root, int k) {
        ListNode cur = root;
        int N = 0;
        while (cur != null) {
            cur = cur.next;
            N++;
        }

        int width = N / k, rem = N % k;

        ListNode[] ans = new ListNode[k];
        cur = root;
        for (int i = 0; i < k; ++i) {
            ListNode head = cur;
            for (int j = 0; j < width + (i < rem ? 1 : 0) - 1; ++j) {
                if (cur != null) cur = cur.next;
            }
            if (cur != null) {
                ListNode prev = cur;
                cur = cur.next;
                prev.next = null;
            }
            ans[i] = head;
        }
        return ans;
    }
}