Merge pull request neetcode-gh#2412 from PorasS/main

Create 0092-reverse-linked-list-ll.java

Author: a93a

README.md

@@ -183,7 +183,7 @@ If you would like to have collaborator permissions on the repo to merge your own
 <sub>[0148 - Sort List](https://leetcode.com/problems/sort-list/)</sub> | <sub><div align='center'>[✔️](c%2F0148-sort-list.c)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F0148-sort-list.java)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](python%2F0148-sort-list.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[0086 - Partition List](https://leetcode.com/problems/partition-list/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F0086-partition-list.java)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](python%2F0086-partition-list.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[0061 - Rotate List](https://leetcode.com/problems/rotate-list/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0061-rotate-list.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F0061-rotate-list.java)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](python%2F0061-rotate-list.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
-<sub>[0092 - Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0092-reverse-linked-list-ii.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](javascript%2F0092-reverse-linked-list-ii.js)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](python%2F0092-reverse-linked-list-ii.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
+<sub>[0092 - Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0092-reverse-linked-list-ii.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F0092-reverse-linked-list-ll.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0092-reverse-linked-list-ii.js)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](python%2F0092-reverse-linked-list-ii.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[0622 - Design Circular Queue](https://leetcode.com/problems/design-circular-queue/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0622-design-circular-queue.go)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0622-design-circular-queue.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0622-design-circular-queue.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[0147 - Insertion Sort List](https://leetcode.com/problems/insertion-sort-list/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](python%2F0147-insertion-sort-list.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[0146 - LRU Cache](https://leetcode.com/problems/lru-cache/)</sub> | <sub><div align='center'>[✔️](c%2F0146-lru-cache.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0146-lru-cache.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0146-lru-cache.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0146-lru-cache.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0146-lru-cache.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0146-lru-cache.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0146-lru-cache.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0146-lru-cache.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0146-lru-cache.rb)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>

java/0092-reverse-linked-list-ll.java

@@ -0,0 +1,61 @@
+/**
+ * Definition for singly-linked list.
+ * 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; }
+ * }
+ */
+class Solution {
+  public ListNode reverseBetween(ListNode head, int left, int right) {
+
+    if (head == null || head.next == null) {
+      return head;
+    }
+
+    if (left > right || left == right) {
+      return head;
+    }
+
+    ListNode l = head;
+    ListNode prevL = null;
+    ListNode r = head;
+    ListNode nextR = null;
+    int posL = 1;
+    int posR = 1;
+
+    while (posL != left) {
+      prevL = l;
+      l = l.next;
+      posL++;
+    }
+
+    while (posR != right) {
+      r = r.next;
+      posR++;
+    }
+
+    nextR = r.next;
+    r.next = null;
+    ListNode node = reverseList(l);
+    node.next = nextR;
+    if (prevL == null) {
+      head = r;
+    } else {
+      prevL.next = r;
+    }
+    return head;
+  }
+
+  public ListNode reverseList(ListNode l) {
+    if (l.next == null) {
+      return l;
+    }
+    ListNode newNode = reverseList(l.next);
+    newNode.next = l;
+    l.next = null;
+    return l;
+  }
+}