思路

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

code


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

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

Leetcode Golang 61. Rotate List.go相关推荐

leetcode 61 Rotate List ----- java
Given a list, rotate the list to the right by k places, where k is non-negative. For example: Given ...
LeetCode 61. Rotate List
题目: Given a list, rotate the list to the right by k places, where k is non-negative. For example: Gi ...
leetcode 61. Rotate List
Given 1->2->3->4->5->NULL and k = 2, return 4->5->1->2->3->NULL. 定义两个指 ...
61. Rotate List
题目: Given a list, rotate the list to the right by k places, where k is non-negative. For example: Gi ...
【LeetCode】48. Rotate Image (2 solutions)
Rotate Image You are given an n x n 2D matrix representing an image. Rotate the image by 90 degrees ...
LeetCode Golang 9.回文数
9. 回文数第一种办法 :itoa 转换为字符串进行处理: package mainimport ("strconv""fmt" )//判断一个整数是否是回文 ...
Leetcode Golang 77. Combinations.go
思路看到这个词,马上就想到了回溯 code func combine(n int, k int) [][]int {var res [][]inthelper(&res, []int{}, ...
【LeetCode】61.旋转链表
给定一个链表,旋转链表,将链表每个节点向右移动 k 个位置,其中 k 是非负数. 示例 1: 输入: 1->2->3->4->5->NULL, k = 2 输出: 4-& ...
【Golang Leetcode】总目录（Day1~100）
Leetcode Golang Day1~10 Golang每日一练(leetDay0001) 1. 两数之和 Two Sum 2. 两数相加 Add Two Numbers 3. 无重复字符的最长子 ...

Leetcode Golang 61. Rotate List.go

思路

code

Leetcode Golang 61. Rotate List.go相关推荐

最新文章

热门文章