LWC 58:725. Split Linked List in Parts

LWC 58:725. Split Linked List in Parts

传送门:725. Split Linked List in Parts

Problem:

Given a (singly) linked list with head node root, write a function to split the linked list into k consecutive linked list “parts”. The length of each part should be as equal as possible: no two parts should have a size differing by more than 1. This may lead to some parts being null. The parts should be in order of occurrence in the input list, and parts occurring earlier should always have a size greater than or equal parts occurring later. Return a List of ListNode’s representing the linked list parts that are formed. Examples 1->2->3->4, k = 5 // 5 equal parts [ 1, [2], [3], [4], null ]

Example 1:

Input: root = [1, 2, 3], k = 5 Output: [1,[2],[3],[],[]] Explanation: The input and each element of the output are ListNodes, not arrays. For example, the input root has root.val = 1, root.next.val = 2, \root.next.next.val = 3, and root.next.next.next = null. The first element output[0] has output[0].val = 1, output[0].next = null. The last element output[4] is null, but it’s string representation as a ListNode is [].

Example 2:

Input: root = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], k = 3 Output: [[1, 2, 3, 4], [5, 6, 7], [8, 9, 10]] Explanation: The input has been split into consecutive parts with size difference at most 1, and earlier parts are a larger size than the later parts.

Note:

The length of root will be in the range [0, 1000].

Each value of a node in the input will be an integer in the range [0, 999].

k will be an integer in the range [1, 50].

思路: 模拟k个槽的分配即可,把所有元素按顺序的放入每个槽内,这样所有的元素放入完毕后就能得到每个槽对应的元素个数,按照这些值进行链表结点的分配。

代码如下:

    public ListNode[] splitListToParts(ListNode root, int k) {
        ListNode[] nodes = new ListNode[k];

        for (int i = 0; i < k; ++i) {
            nodes[i] = new ListNode(-1);
        }

        ListNode[] curs = new ListNode[k];
        for (int i = 0; i < k; ++i) {
            curs[i] = nodes[i];
        }

        int[] nums = new int[k];

        int size = 0;
        for (ListNode cur = root; cur != null; cur = cur.next, size++) {
            nums[size % k]++;
        }

        int j = 0;
        for (ListNode cur = root; cur != null; cur = cur.next){
            curs[j].next = new ListNode(cur.val);
            curs[j] = curs[j].next;
            nums[j] --;
            if (nums[j] == 0) {
                j ++;
            }
        }

        for (int i = 0; i < k; ++i) {
            nodes[i] = nodes[i].next;
        }

        return nodes;
    }  

本文参与腾讯云自媒体分享计划,欢迎正在阅读的你也加入,一起分享。

发表于

我来说两句

0 条评论
登录 后参与评论

相关文章

来自专栏赵俊的Java专栏

两个链表的交叉

21230
来自专栏韦弦的偶尔分享

Swift 环形链表- LeetCode

可以转化为一个追击问题 前后双指针,slow走一步,fast走两步,如果有环存在,一定会相遇的。

14230
来自专栏xiaoxi666的专栏

【左神算法课】超经典:求两单向链表交点(6种情况)

    若一个有环一个无环,直接返回NULL,因为如果他们相交,是不可能一个有环一个无环的(图中情况3);

16020
来自专栏desperate633

LeetCode 142. Linked List Cycle II题目分析代码

给定一个链表,如果链表中存在环,则返回到链表中环的起始节点的值,如果没有环,返回null。

9730
来自专栏五分钟学算法

每天一算:Remove Linked List Elements

LeetCode上第203号问题:Remove Linked List Elements

8730
来自专栏数据结构与算法

洛谷P3531 [POI2012]LIT-Letters

题目描述 Little Johnny has a very long surname. Yet he is not the only such person i...

28390
来自专栏赵俊的Java专栏

有环链表

18830
来自专栏LeetCode

LeetCode 203 & 237. Delete Node in a Linked List

Write a function to delete a node (except the tail) in a singly linked list, giv...

14800
来自专栏Java编程

Java中创建对象的5种方式

作为Java开发者,我们每天创建很多对象,但我们通常使用依赖管理系统,比如Spring去创建对象。然而这里有很多创建对象的方法,我们会在这篇文章中学到。

2K20
来自专栏Leetcode名企之路

【Leetcode】82. 删除排序链表中的重复元素 II

给定一个排序链表,删除所有含有重复数字的节点,只保留原始链表中 没有重复出现 的数字。

13730

扫码关注云+社区

领取腾讯云代金券