Leetcode rotate single linked list https://leetcode-cn.com/problems/rotate-list/

solution.go

/**
 * Definition for singly-linked list.
 * type ListNode struct {
 *     Val int
 *     Next *ListNode
 * }
 */
func rotateRight(head *ListNode, k int) *ListNode {
    //insertNode := &ListNode{0,nil}
    //insertNode = head
    var cursor *ListNode 
    var j int = 0
    if k >0 && head !=nil && head.Next !=nil{
         curNode := head
         for curNode.Next.Next !=nil {
             curNode = curNode.Next
             j++
         }
         count := j+2 
         num := k%count
         for i:=0; i< num; i++ {
            curNode = head
            for curNode.Next !=nil{
                if curNode.Next.Next != nil{
                        curNode = curNode.Next
                }else{
                    cursor = curNode.Next
                    curNode.Next = nil
                    cursor.Next = head
                    head = cursor 
                }
            }
         }
    }
return head
}