FilesExpand file tree

 master

/

Solution.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

38 lines (36 loc) · 909 Bytes

 master

/

Solution.java

Copy path

Top

File metadata and controls

• Code
• Blame

38 lines (36 loc) · 909 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

package leetcode._92_;

import leetcode.common.ListNode;

/**

* Definition for singly-linked list.

* public class ListNode {

* int val;

* ListNode next;

* ListNode(int x) { val = x; }

* }

*/

class Solution {

public ListNode reverseBetween(ListNode head, int m, int n) {

ListNode fakeNode = new ListNode(-1);

fakeNode.next = head;

ListNode p = fakeNode;

ListNode q = head;

int index = 1;

while (q.next != null) {

if (index >= m && index < n) {

ListNode node = q.next;

q.next = q.next.next;

node.next = p.next;

p.next = node;

} else {

q = q.next;

}

if (index < m) {

p = p.next;

}

if (++index >= n) {

break;

}

}

return fakeNode.next;

}

}