zoukankan      html  css  js  c++  java
  • 725. Split Linked List in Parts

    725. Split Linked List in Parts
    Medium

    Given a (singly) linked list with head node root, write a function to split the linked list into kconsecutive 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, 
    oot.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].
    /**
     * Definition for singly-linked list.
     * struct ListNode {
     *     int val;
     *     ListNode *next;
     *     ListNode(int x) : val(x), next(NULL) {}
     * };
     */
    class Solution {
    public:
        vector<ListNode*> splitListToParts(ListNode* root, int k) {
            vector<ListNode*> result(k);
            if (root == NULL){
                //result.push_back(NULL);
                return result;
            }
            
            // 首先遍历链表看有多少个结点
            int num = 0;
            ListNode* curPtr = root;
            while (curPtr != NULL){
                num++;
                curPtr = curPtr -> next;
            }
           
            // 根据结点数和k的关系 分配每个链表的结点数      
            int avg = num / k, ext = num % k;
            
            for (int i = 0; i < k && root; ++i) {
                
                result[i] = root;
                for (int j = 1; j < avg + (i < ext); ++j) {
                    root = root->next;
                }
                ListNode *t = root->next;
                root->next = NULL;
                root = t;
            }
          
            return result;
        }
    };

    需要注意的是断链的操作。

  • 相关阅读:
    spring-base.xml
    计算和证明施密特正交,写的很清楚
    推理
    存在某种关系时,推理存在新关系
    PyCharm 技巧
    3#记录
    2#记录
    一文揭秘!自底向上构建知识图谱全过程
    1#记录
    本体建模小结
  • 原文地址:https://www.cnblogs.com/simplepaul/p/10793469.html
Copyright © 2011-2022 走看看