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 条评论
登录 后参与评论

相关文章

来自专栏小樱的经验随笔

Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)(A.思维题,B.思维题)

A. Vicious Keyboard time limit per test:2 seconds memory limit per test:256 mega...

3117
来自专栏尾尾部落

[LeetCode]Longest Continuous Increasing Subsequence 最长连续增长序列 [LeetCode]Longest Continuous Incr

链接:https://leetcode.com/problems/longest-continuous-increasing-subsequence/descr...

471
来自专栏ml

HDUOJ----(1030)Delta-wave

Delta-wave Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K...

3287
来自专栏ml

hdu----(1466)计算直线的交点数(dp)

计算直线的交点数 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (...

3417
来自专栏Petrichor的专栏

leetcode: 100. Same Tree

821
来自专栏算法修养

HOJ-2056 Bookshelf(线性动态规划)

L is a rather sluttish guy. He almost never clean up his surroundings or regulat...

3127
来自专栏ml

HDUOJ---1195Open the Lock

Open the Lock Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/3276...

2636
来自专栏算法修养

HOJ 2156 &POJ 2978 Colored stones(线性动规)

Colored stones Time Limit: 1000MS Memory Limit: 65536K Total Submission...

3058
来自专栏ml

hdu---(3779)Railroad(记忆化搜索/dfs)

Railroad Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (...

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

BZOJ1211: [HNOI2004]树的计数(prufer序列)

Time Limit: 10 Sec  Memory Limit: 162 MB Submit: 2987  Solved: 1111 Description ...

2717

扫码关注云+社区