leetcode25. K 个一组翻转链表

 

给你一个链表，每 k 个节点一组进行翻转，请你返回翻转后的链表。

k 是一个正整数，它的值小于或等于链表的长度。

如果节点总数不是 k 的整数倍，那么请将最后剩余的节点保持原有顺序。

 

示例：

给你这个链表：1->2->3->4->5

当 k = 2 时，应当返回: 2->1->4->3->5

当 k = 3 时，应当返回: 3->2->1->4->5

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/reverse-nodes-in-k-group
 

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    def reverseKGroup(self, head: ListNode, k: int) -> ListNode:
        cur = head
        count = 0
        while cur and count!= k:
            cur = cur.next
            count += 1
        if count == k:
            cur = self.reverseKGroup(cur, k)
            while count:
                tmp = head.next
                head.next = cur
                cur = head
                head = tmp
                count -= 1
            head = cur   
        return head

/**
 * Definition for singly-linked list.
 * type ListNode struct {
 *     Val int
 *     Next *ListNode
 * }
 */
func reverseKGroup(head *ListNode, k int) *ListNode {
    if k==1{
        return head
    }
    tail := head
    i:=1
    for tail!=nil&&i<k{
        tail = tail.Next
        i++
    }
    var newhead,newNext *ListNode
    if tail!=nil{
        temp:= tail.Next
        tail.Next = nil
        newhead=reverse(head)
        newNext=reverseKGroup(temp,k)
        head.Next = newNext
        return newhead
    }else{
        return head
    }
}

func reverse(head *ListNode) *ListNode{
    if head==nil&&head.Next==nil{
        return head
    }
    var pre *ListNode
    for head!=nil{
        temp:=head.Next
        head.Next = pre
        pre,head = head,temp
    }
    return pre
    //newhead := reverse(head.Next)
    //head.Next.Next = head
    //head.Next = nil
    //return newhead
}