-
Notifications
You must be signed in to change notification settings - Fork 28
/
Copy pathSolution.java
46 lines (38 loc) · 1.04 KB
/
Solution.java
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
class Solution {
public class ListNode {
int val;
ListNode next;
ListNode() {
}
ListNode(int val) {
this.val = val;
}
ListNode(int val, ListNode next) {
this.val = val;
this.next = next;
}
}
public ListNode reverseBetween(ListNode head, int left, int right) {
ListNode dummyHead = new ListNode();
ListNode iter = dummyHead;
for (int i = 1; i < left; i++) {
iter.next = head;
iter = iter.next;
head = head.next;
}
ListNode reversedHead = null;
ListNode reversedTail = null;
for (int i = left; i <= right; i++) {
if (reversedTail == null) {
reversedTail = head;
}
ListNode tmp = head;
head = head.next;
tmp.next = reversedHead;
reversedHead = tmp;
}
iter.next = reversedHead;
reversedTail.next = head;
return dummyHead.next;
}
}