@@ -0,0 +1,644 @@
+public class LeetCode0092 %7B%0A%0A%09public class ListNode %7B%0A%09%09int val;%0A%09%09ListNode next;%0A%0A%09%09ListNode(int x) %7B%0A%09%09%09val = x;%0A%09%09%7D%0A%09%7D%0A%0A%09public ListNode reverseBetween(ListNode head, int m, int n) %7B%0A%09%09if (head == null %7C%7C m %3E= n) %7B%0A%09%09%09return head;%0A%09%09%7D%0A%0A%09%09ListNode dummy = new ListNode(0);%0A%09%09dummy.next = head;%0A%0A%09%09ListNode pre = dummy;%0A%0A%09%09int count = 1;%0A%09%09while (count %3C m && pre.next != null) %7B%0A%09%09%09count++;%0A%09%09%09pre = pre.next;%0A%09%09%7D%0A%0A%09%09ListNode first = pre;%0A%09%09pre = pre.next;%0A%09%09ListNode p = pre.next;%0A%0A%09%09while (count %3C n && p != null) %7B%0A%09%09%09pre.next = p.next;%0A%09%09%09p.next = first.next;%0A%09%09%09first.next = p;%0A%09%09%09p = pre.next;%0A%09%09%09count++;%0A%09%09%7D%0A%0A%09%09return dummy.next;%0A%09%7D%0A%7D

Add index of LeetCode0092.java to docs