[25] K 个一组翻转链表

  1.总体代码

/*
 * @lc app=leetcode.cn id=25 lang=javascript
 *
 * [25] K 个一组翻转链表
 */

// @lc code=start
/**
 * Definition for singly-linked list.
 * function ListNode(val, next) {
 *     this.val = (val===undefined ? 0 : val)
 *     this.next = (next===undefined ? null : next)
 * }
 */
/**
 * @param {ListNode} head
 * @param {number} k
 * @return {ListNode}
 */
var reverseKGroup = function (head, k) {
  // 如果链表为空，则返回空
  if (!head) return null;
  // 定义tail,表示满足k的链表，不满足就返回剩余内容
  var tail = head;
  for (var i = 1; i < k; i++) {
    tail = tail.next;
    if (!tail) return head;
  }
  //  下一段的开头
  var next = tail.next;
  // 将满足的小段，断开
  tail.next = null;
  reverse(head);
  head.next = reverseKGroup(next, k);
  return tail;
};
// 将一个链表翻转
function reverse(cur) {
  var pre = null;
  while (cur) {
    var next = cur.next;
    cur.next = pre;
    pre = cur;
    cur = next;
  }
  return pre;
}
// @lc code=end

 2.分步解读

    链表翻转

 分组翻转相加