leetcode 725. Split Linked List in Parts
来源:互联网 发布:java输出个数的空格 编辑:程序博客网 时间:2024/05/19 02:41
725. Split Linked List in Parts
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 = 3Output: [[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:
root
will be in the range [0, 1000]
.[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) { int size = 0; ListNode* p = root; while (p) { size++; p = p->next; } int jiben = size / k; int duoyu = size % k; //余数 代表 前面几项会比后面几项多一个 vector<ListNode*> ret; ListNode* now_root = root; for (int i = 0; i < k; i++) { ret.push_back(now_root); if (!now_root) continue; int flag = (duoyu-- > 0) ? 1 : 0; //多一个的项flag = 1 for (int j = 1; j < jiben + flag; j++) { now_root = now_root->next; } ListNode* last = now_root; now_root = last->next; last->next = NULL; //断尾 } return ret; } };
阅读全文
0 0
- leetcode 725. Split Linked List in Parts
- LeetCode 725 (Split Linked List in Parts)
- LeetCode-Split Linked List in Parts
- 725. Split Linked List in Parts
- 725. Split Linked List in Parts。
- 725. Split Linked List in Parts
- 725. Split Linked List in Parts
- Split Linked List in Parts
- LWC 58:725. Split Linked List in Parts
- Split Linked List in Parts(LeetCode725)
- Split Linked List in Parts问题及解法
- Split Linked List in Parts:切分链表
- 【Leetcode】Reverse Linked List II in JAVA
- leetcode: Delete Node in a Linked List
- LeetCode Delete Node in a Linked List
- 【leetcode】Delete Node in a Linked List
- Leetcode: Delete Node in a Linked List
- [LeetCode]Delete Node in a Linked List
- [差量更新系列1]BSDiff算法学习笔记
- Perhaps you are running on a JRE rather than a JDK? [ERROR] -> [Help 1]
- java8实战八:java8----默认方法
- 三、内核时钟(2)
- hibernate_day01_
- leetcode 725. Split Linked List in Parts
- java8之----Optional取代null
- phpQuery的用法
- 在VC++中读写INI文件
- 彻底搞懂Java内存泄露
- 怎么看懂和编写makefile
- java 中==和equals的区别
- alljoyn 框架
- hibernate_day02_02_实体类编写规则和03_hibernate主键生成策略