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 = 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].
  

  思路：

  首先，统计整个链表长度（因为是链表，要“均匀”切分，在不知道总长度的情况下是无法指定“均匀的”）

  然后，计算每一段长度。注意由于每一段长度不能相差大于1，所以在均匀分配的基础上（整除），对余数均匀分配

  最后，在结果表达上，可以对原链表切分，也可以新建链表。我是对原链表进行切分。

  
  

  /**
   * Definition for singly-linked list.
   * public class ListNode {
   *     int val;
   *     ListNode next;
   *     ListNode(int x) { val = x; }
   * }
   */
  class Solution {
         public ListNode[] splitListToParts(ListNode root, int k) {
          int length = 0;//定义链表长度
          ListNode[] result = new ListNode[k];//定义结果
          ListNode n = root;
          ListNode pre = null;//记录每一端的最后位置，用于切断链表时使用
          while(n!=null){
              length ++;
              n = n.next;
          }
          int count = 0;//记录添加了几段，用于(1,5)这种情况
          int partlen = length/k;//每一段可能的最短长度
          int flag = length%k;//需要平均分配的剩余长度，如(11,4),需要<3,3,3,2>,而不能是<2,2,2,5>
          //所以在length/k得到每段的最短长度后，要把剩余的部分length%k再次均匀分配掉
          while(count<k){
              int i = partlen;
              result[count] = root;
              while(i>0){
                  if(root!=null){
                      pre = root;
                      root = root.next;
                      i--;
                  }
              }
              if(flag > 0){
                  pre = root;
                  root = root.next;
                  flag--;
              }
              if(pre!=null) pre.next = null;
              count++;
          }
          
          return result;
      }
  }

  
  随着接触的题目数量增多，leetcode中等难度的题已经没有思路问题了，就是实现比较慢，也算进步吧