Added ListNode description.

Author: javadev

src.save/main/java/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.java

@@ -5,22 +5,30 @@
 
 import com_github_leetcode.ListNode;
 
+/*
+ * 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; }
+ * }
+ */
 public class Solution {
- int n;
+ private int n;
 
  public ListNode removeNthFromEnd(ListNode head, int n) {
  this.n = n;
  ListNode node = new ListNode(0, head);
  removeNth(node);
-
  return node.next;
  }
 
  private void removeNth(ListNode node) {
  if (node.next == null) {
  return;
  }
-
  removeNth(node.next);
  this.n--;
 

src.save/main/java/g0001_0100/s0021_merge_two_sorted_lists/Solution.java

@@ -6,6 +6,16 @@
 
 import com_github_leetcode.ListNode;
 
+/*
+ * 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; }
+ * }
+ */
 public class Solution {
  public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
  ListNode list = new ListNode(-1);

src.save/main/java/g0001_0100/s0023_merge_k_sorted_lists/Solution.java

@@ -5,6 +5,16 @@
 
 import com_github_leetcode.ListNode;
 
+/*
+ * 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; }
+ * }
+ */
 public class Solution {
  public ListNode mergeKLists(ListNode[] lists) {
  if (lists.length == 0) {

src.save/main/java/g0001_0100/s0024_swap_nodes_in_pairs/Solution.java

@@ -5,6 +5,16 @@
 
 import com_github_leetcode.ListNode;
 
+/*
+ * 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; }
+ * }
+ */
 public class Solution {
  public ListNode swapPairs(ListNode head) {
  if (head == null) {

src.save/main/java/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.java

@@ -5,6 +5,16 @@
 
 import com_github_leetcode.ListNode;
 
+/*
+ * 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; }
+ * }
+ */
 public class Solution {
  public ListNode reverseKGroup(ListNode head, int k) {
  if (head == null || head.next == null || k == 1) {

src.save/main/java/g0001_0100/s0061_rotate_list/Solution.java

@@ -5,6 +5,16 @@
 
 import com_github_leetcode.ListNode;
 
+/*
+ * 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; }
+ * }
+ */
 public class Solution {
  public ListNode rotateRight(ListNode head, int k) {
  if (head == null || k == 0) {

src.save/main/java/g0101_0200/s0160_intersection_of_two_linked_lists/Solution.java

@@ -5,6 +5,17 @@
 
 import com_github_leetcode.ListNode;
 
+/*
+ * Definition for singly-linked list.
+ * public class ListNode {
+ * int val;
+ * ListNode next;
+ * ListNode(int x) {
+ * val = x;
+ * next = null;
+ * }
+ * }
+ */
 @SuppressWarnings("java:S2583")
 public class Solution {
  public ListNode getIntersectionNode(ListNode headA, ListNode headB) {

src.save/main/java/g0201_0300/s0206_reverse_linked_list/Solution.java

@@ -6,6 +6,16 @@
 
 import com_github_leetcode.ListNode;
 
+/*
+ * 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; }
+ * }
+ */
 public class Solution {
  public ListNode reverseList(ListNode head) {
  ListNode prev = null;

src.save/main/java/g0201_0300/s0234_palindrome_linked_list/Solution.java

@@ -5,6 +5,16 @@
 
 import com_github_leetcode.ListNode;
 
+/*
+ * 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; }
+ * }
+ */
 public class Solution {
  public boolean isPalindrome(ListNode head) {
  int len = 0;

src.save/main/java/g0301_0400/s0382_linked_list_random_node/Solution.java

@@ -8,6 +8,16 @@
 import java.util.List;
 import java.util.Random;
 
+/*
+ * 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; }
+ * }
+ */
 @SuppressWarnings("java:S2245")
 public class Solution {
  private List<Integer> al;
@@ -33,3 +43,9 @@ public int getRandom() {
  return al.get(ind);
  }
 }
+
+/*
+ * Your Solution object will be instantiated and called as such:
+ * Solution obj = new Solution(head);
+ * int param_1 = obj.getRandom();
+ */