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

相关文章

来自专栏Jack-Cui

第七天、判断三角形的类型

    根据输入的三角形的三条边判断三角形的类型,并输出它的面积和类型。 C代码: /*第七天、判断三角形的类型*/ #include <stdio.h> ...

1880
来自专栏小樱的经验随笔

POJ 3673 Cow Multiplication

Cow Multiplication Time Limit: 1000MS Memory Limit: 65536K Total Submiss...

3436
来自专栏算法修养

HOJ 2226&POJ2688 Cleaning Robot(BFS+TSP(状态压缩DP))

Cleaning Robot Time Limit: 1000MS Memory Limit: 65536K Total Submission...

2624
来自专栏Bingo的深度学习杂货店

Q907 Sum of Subarray Minimums

Given an array of integers A, find the sum of min(B), where B ranges over every ...

633
来自专栏算法修养

HDU 5876 大连网络赛 Sparse Graph

Sparse Graph Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 262144/262...

3146
来自专栏软件开发 -- 分享 互助 成长

原码 反码 补码 移码

1、正数的原码、补码、反码均为其本身; 2、负数(二进制)的原码、补码、反码公式: 反码 = 原码(除符号位外)每位取反 补码 = 反码 + 1 反码 =...

2206
来自专栏LeetCode

LeetCode <dp>152&628 Maximum Product Subarray

Given an integer array nums, find the contiguous subarray within an array (conta...

1064
来自专栏ml

HDU----(4549)M斐波那契数列(小费马引理+快速矩阵幂)

M斐波那契数列 Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (J...

3135
来自专栏ml

poj-----Ultra-QuickSort(离散化+树状数组)

Ultra-QuickSort Time Limit: 7000MS Memory Limit: 65536K Total Submission...

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

POJ 2001 Shortest Prefixes

Description A prefix of a string is a substring starting at the beginning of th...

2639

扫码关注云+社区