Leetcode Golang 61. Rotate List.go

思路

先把list变成一个环，然后转到指定位置
注意有个取模的处理

code

func rotateRight(head *ListNode, k int) *ListNode {
	if head == nil || head.Next == nil || k == 0 {
		return head
	}
	len := 1
	tail := head
	for tail.Next != nil {
		tail = tail.Next
		len++
	}
	tail.Next = head //变成一个环
	k = k % len      //因为是个环，所以不用转超过一圈
	for i := 0; i < len-k; i++ {
		tail = tail.Next
	}
	head = tail.Next
	tail.Next = nil
	return head
}

更多内容请移步我的repo：https://github.com/anakin/golang-leetcode