reverse_nodes_in_k_group
reverse_nodes_in_k_group.go 源码
package main
//k个一组翻转链表
// 暴力法，使用一个数组存储数据，然后再翻转数据重新构造链表
func reverseKGroup1(head *ListNode, k int) *ListNode {
var arr []int
for head != nil {
arr = append(arr, head.Val)
head = head.Next
}
dummy := &ListNode{Val: 0}
cur, step := dummy, 0
for i := 0; i < len(arr); i++ {
if i == step && step+k <= len(arr) {
reverseArr(arr, i, i+k-1)
step += k
}
cur.Next = &ListNode{Val: arr[i]}
cur = cur.Next
}
return dummy.Next
}
func reverseArr(arr []int, i, j int) {
for i < j {
arr[i], arr[j] = arr[j], arr[i]
i++
j--
}
}
//官方解法
func reverseKGroup2(head *ListNode, k int) *ListNode {
dummy := &ListNode{Val: -1}
dummy.Next = head
prev, end := dummy, dummy
reverse := func(node *ListNode) (prev *ListNode) {
p := node
for p != nil {
p.Next, prev, p = prev, p, p.Next
}
return
}
for end.Next != nil {
for i := 0; i < k && end != nil; i++ {
end = end.Next
}
if end == nil {
break
}
start, next := prev.Next, end.Next
end.Next = nil
prev.Next = reverse(start)
start.Next = next
prev = start
end = start
}
return dummy.Next
}
你可能感兴趣的文章
0
赞
热门推荐
-
2、 - 优质文章
-
3、 gate.io
-
8、 golang
-
9、 openharmony
-
10、 Vue中input框自动聚焦