Improved tasks 133, 138, 142, 146

Author: javadev

src.save/main/kotlin/g0101_0200/s0133_clone_graph/Solution.kt

@@ -11,7 +11,6 @@ import com_github_leetcode.neighbors.Node
  *     var neighbors: ArrayList<Node?> = ArrayList<Node?>()
  * }
  */
-
 class Solution {
     fun cloneGraph(node: Node?): Node? {
         return cloneGraph(node, HashMap())

src.save/main/kotlin/g0101_0200/s0138_copy_list_with_random_pointer/Solution.kt

@@ -6,6 +6,16 @@ package g0101_0200.s0138_copy_list_with_random_pointer
 
 import com_github_leetcode.random.Node
 
+/*
+ * Example:
+ * var ti = Node(5)
+ * var v = ti.`val`
+ * Definition for a Node.
+ * class Node(var `val`: Int) {
+ *     var next: Node? = null
+ *     var random: Node? = null
+ * }
+ */
 class Solution {
     fun copyRandomList(head: Node?): Node? {
         if (head == null) {

src.save/main/kotlin/g0101_0200/s0142_linked_list_cycle_ii/Solution.kt

@@ -6,6 +6,15 @@ package g0101_0200.s0142_linked_list_cycle_ii
 
 import com_github_leetcode.ListNode
 
+/*
+ * Example:
+ * var li = ListNode(5)
+ * var v = li.`val`
+ * Definition for singly-linked list.
+ * class ListNode(var `val`: Int) {
+ *     var next: ListNode? = null
+ * }
+ */
 class Solution {
     fun detectCycle(head: ListNode?): ListNode? {
         if (head?.next == null) {

src.save/main/kotlin/g0101_0200/s0146_lru_cache/LRUCache.kt

@@ -4,11 +4,10 @@ package g0101_0200.s0146_lru_cache
 // #Doubly_Linked_List #Udemy_Linked_List #2022_09_03_Time_1116_ms_(97.93%)_Space_139.6_MB_(97.51%)
 
 class LRUCache(capacity: Int) {
-
     private val nodeMap = HashMap<Int, Node>()
-    val head = Node()
+    private val head = Node()
     private val tail = Node()
-    var cacheCapacity = 0
+    private var cacheCapacity = 0
 
     init {
         head.next = tail
@@ -66,3 +65,10 @@ class LRUCache(capacity: Int) {
 
     data class Node(var key: Int = -1, var value: Int = -1, var next: Node? = null, var prev: Node? = null)
 }
+
+/*
+ * Your LRUCache object will be instantiated and called as such:
+ * var obj = LRUCache(capacity)
+ * var param_1 = obj.get(key)
+ * obj.put(key,value)
+ */