Updated tasks 23, 25, 47

Author: javadev

src.save/main/kotlin/g0001_0100/s0023_merge_k_sorted_lists/Solution.kt

@@ -5,6 +5,15 @@ package g0001_0100.s0023_merge_k_sorted_lists
 
 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 mergeKLists(lists: Array<ListNode>): ListNode? {
         return if (lists.isEmpty()) {

src.save/main/kotlin/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.kt

@@ -5,6 +5,15 @@ package g0001_0100.s0025_reverse_nodes_in_k_group
 
 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 reverseKGroup(head: ListNode?, k: Int): ListNode? {
         if (head?.next == null || k == 1) {

src.save/main/kotlin/g0001_0100/s0047_permutations_ii/Solution.kt

@@ -5,6 +5,7 @@ package g0001_0100.s0047_permutations_ii
 
 class Solution {
     private var ans: MutableList<List<Int>>? = null
+
     fun permuteUnique(nums: IntArray): List<List<Int>> {
         ans = ArrayList()
         permute(nums, 0)