-
Notifications
You must be signed in to change notification settings - Fork 6
/
test.go
62 lines (54 loc) · 755 Bytes
/
test.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
package main
type ListNode struct {
Val int
Next *ListNode
}
func reverseBetween(head *ListNode, m int, n int) *ListNode {
if nil == head || nil == head.Next ||
m == n {
return head
}
step := n - m
var leftTail *ListNode
p := head
for m > 1 {
leftTail = p
p = p.Next
m--
}
q := p.Next
p.Next = nil
midTail := p
for step > 0 {
r := q.Next
q.Next = p
p = q
q = r
step--
}
if nil == leftTail {
midTail.Next = q
return p
}
leftTail.Next = p
midTail.Next = q
return head
}
func main() {
head := &ListNode{
Val: 1,
Next: &ListNode{
Val: 2,
Next: &ListNode{
Val: 3,
Next: &ListNode{
Val: 4,
Next: &ListNode{
Val: 5,
},
},
},
},
}
reverseBetween(head, 1, 4)
}