Updated tags, fixed compile warnings.

javadev · web-flow · commit 1fc7ed624a23 · 2022-09-27T04:05:38.000+03:00
diff --git a/README.md b/README.md
diff --git a/src/main/kotlin/g0001_0100/s0050_powx_n/Solution.kt b/src/main/kotlin/g0001_0100/s0050_powx_n/Solution.kt
@@ -1,8 +1,9 @@
 package g0001_0100.s0050_powx_n
 
 // #Medium #Top_Interview_Questions #Math #Recursion #Udemy_Integers
-// #2022_09_21_Time_307_ms_(17.33%)_Space_35.2_MB_(54.67%)
+// #2022_09_27_Time_264_ms_(52.98%)_Space_34.9_MB_(76.82%)
 
+@Suppress("NAME_SHADOWING")
 class Solution {
     fun myPow(x: Double, n: Int): Double {
         var x = x
diff --git a/src/main/kotlin/g0001_0100/s0059_spiral_matrix_ii/Solution.kt b/src/main/kotlin/g0001_0100/s0059_spiral_matrix_ii/Solution.kt
@@ -1,7 +1,7 @@
 package g0001_0100.s0059_spiral_matrix_ii
 
 // #Medium #Array #Matrix #Simulation #Data_Structure_II_Day_3_Array
-// #2022_09_22_Time_292_ms_(18.33%)_Space_34.7_MB_(71.67%)
+// #2022_09_27_Time_153_ms_(100.00%)_Space_34_MB_(98.15%)
 
 class Solution {
     fun generateMatrix(n: Int): Array<IntArray> {
diff --git a/src/main/kotlin/g0001_0100/s0060_permutation_sequence/Solution.kt b/src/main/kotlin/g0001_0100/s0060_permutation_sequence/Solution.kt
@@ -2,6 +2,7 @@ package g0001_0100.s0060_permutation_sequence
 
 // #Hard #Math #Recursion #2022_09_22_Time_293_ms_(27.78%)_Space_34.2_MB_(61.11%)
 
+@Suppress("NAME_SHADOWING")
 class Solution {
     fun getPermutation(n: Int, k: Int): String {
         var k = k
diff --git a/src/main/kotlin/g0001_0100/s0086_partition_list/Solution.kt b/src/main/kotlin/g0001_0100/s0086_partition_list/Solution.kt
@@ -13,6 +13,7 @@ import com_github_leetcode.ListNode
  *     var next: ListNode? = null
  * }
  */
+@Suppress("NAME_SHADOWING")
 class Solution {
     fun partition(head: ListNode?, x: Int): ListNode? {
         var head = head
diff --git a/src/main/kotlin/g0001_0100/s0089_gray_code/Solution.kt b/src/main/kotlin/g0001_0100/s0089_gray_code/Solution.kt
@@ -1,12 +1,11 @@
 package g0001_0100.s0089_gray_code
 
 // #Medium #Math #Bit_Manipulation #Backtracking
-// #2022_09_26_Time_528_ms_(62.86%)_Space_61.8_MB_(88.57%)
-
-import java.util.Arrays
+// #2022_09_27_Time_273_ms_(100.00%)_Space_44.1_MB_(97.14%)
 
+@Suppress("NAME_SHADOWING")
 class Solution {
-    fun grayCode(n: Int): List<Int> {
+    fun grayCode(n: Int): List<Int?> {
         var n = n
         var n1 = arrayOf<Int?>(0)
         var shift = 1
@@ -16,13 +15,13 @@ class Solution {
             for (integer in n1) {
                 temp[pos++] = integer
             }
-            for (i in 0..n1.size - 1) {
-                temp[pos++] = n1[n1.size - i - 1]!! or shift
+            for (i in n1.indices.reversed()) {
+                temp[pos++] = n1[i]!! or shift
             }
             n1 = temp
             shift = shift shl 1
             n--
         }
-        return Arrays.asList(*n1) as List<Int>
+        return listOf(*n1)
     }
 }
diff --git a/src/main/kotlin/g0001_0100/s0091_decode_ways/Solution.kt b/src/main/kotlin/g0001_0100/s0091_decode_ways/Solution.kt
@@ -2,7 +2,7 @@ package g0001_0100.s0091_decode_ways
 
 // #Medium #Top_Interview_Questions #String #Dynamic_Programming
 // #Algorithm_II_Day_15_Dynamic_Programming #Dynamic_Programming_I_Day_10
-// #2022_09_26_Time_327_ms_(17.68%)_Space_34.7_MB_(82.93%)
+// #2022_09_27_Time_237_ms_(76.88%)_Space_34.5_MB_(86.88%)
 
 class Solution {
     fun numDecodings(s: String): Int {
diff --git a/src/main/kotlin/g0001_0100/s0092_reverse_linked_list_ii/Solution.kt b/src/main/kotlin/g0001_0100/s0092_reverse_linked_list_ii/Solution.kt
@@ -13,6 +13,7 @@ import com_github_leetcode.ListNode
  *     var next: ListNode? = null
  * }
  */
+@Suppress("NAME_SHADOWING")
 class Solution {
     fun reverseBetween(head: ListNode?, left: Int, right: Int): ListNode? {
         var head = head
diff --git a/src/main/kotlin/g0001_0100/s0094_binary_tree_inorder_traversal/Solution.kt b/src/main/kotlin/g0001_0100/s0094_binary_tree_inorder_traversal/Solution.kt
@@ -2,10 +2,20 @@ package g0001_0100.s0094_binary_tree_inorder_traversal
 
 // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Tree #Binary_Tree
 // #Stack #Data_Structure_I_Day_10_Tree #Udemy_Tree_Stack_Queue
-// #2022_09_01_Time_283_ms_(17.97%)_Space_35.7_MB_(17.47%)
+// #2022_09_27_Time_269_ms_(38.80%)_Space_35.9_MB_(14.49%)
 
 import com_github_leetcode.TreeNode
 
+/*
+ * Example:
+ * var ti = TreeNode(5)
+ * var v = ti.`val`
+ * Definition for a binary tree node.
+ * class TreeNode(var `val`: Int) {
+ *     var left: TreeNode? = null
+ *     var right: TreeNode? = null
+ * }
+ */
 class Solution {
     fun inorderTraversal(root: TreeNode?): List<Int> {
         if (root == null) {
diff --git a/src/main/kotlin/g0001_0100/s0095_unique_binary_search_trees_ii/Solution.kt b/src/main/kotlin/g0001_0100/s0095_unique_binary_search_trees_ii/Solution.kt
@@ -39,7 +39,7 @@ class Solution {
     }
 
     private fun insert(dest: TreeNode?, n: TreeNode, from: TreeNode) {
-        if (dest != null && dest.`val` === from.`val`) {
+        if (dest != null && dest.`val` == from.`val`) {
             val h: TreeNode? = dest.right
             dest.right = n
             n.left = h
@@ -53,6 +53,6 @@ class Solution {
     private fun copy(n: TreeNode?): TreeNode? {
         return if (n == null) {
             null
-        } else TreeNode(n.`val`, copy(n.left), copy(n.right))
+        } else { TreeNode(n.`val`, copy(n.left), copy(n.right)) }
     }
 }
diff --git a/src/main/kotlin/g0001_0100/s0098_validate_binary_search_tree/Solution.kt b/src/main/kotlin/g0001_0100/s0098_validate_binary_search_tree/Solution.kt
@@ -6,6 +6,16 @@ package g0001_0100.s0098_validate_binary_search_tree
 
 import com_github_leetcode.TreeNode
 
+/*
+ * Example:
+ * var ti = TreeNode(5)
+ * var v = ti.`val`
+ * Definition for a binary tree node.
+ * class TreeNode(var `val`: Int) {
+ *     var left: TreeNode? = null
+ *     var right: TreeNode? = null
+ * }
+ */
 class Solution {
     fun isValidBST(root: TreeNode?): Boolean {
         return solve(root, Long.MIN_VALUE, Long.MAX_VALUE)
diff --git a/src/main/kotlin/g0101_0200/s0101_symmetric_tree/Solution.kt b/src/main/kotlin/g0101_0200/s0101_symmetric_tree/Solution.kt
@@ -6,6 +6,16 @@ package g0101_0200.s0101_symmetric_tree
 
 import com_github_leetcode.TreeNode
 
+/*
+ * Example:
+ * var ti = TreeNode(5)
+ * var v = ti.`val`
+ * Definition for a binary tree node.
+ * class TreeNode(var `val`: Int) {
+ *     var left: TreeNode? = null
+ *     var right: TreeNode? = null
+ * }
+ */
 class Solution {
     fun isSymmetric(root: TreeNode?): Boolean {
         return if (root == null) {
diff --git a/src/main/kotlin/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.kt b/src/main/kotlin/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.kt
@@ -9,6 +9,16 @@ import java.util.ArrayList
 import java.util.LinkedList
 import java.util.Queue
 
+/*
+ * Example:
+ * var ti = TreeNode(5)
+ * var v = ti.`val`
+ * Definition for a binary tree node.
+ * class TreeNode(var `val`: Int) {
+ *     var left: TreeNode? = null
+ *     var right: TreeNode? = null
+ * }
+ */
 class Solution {
     fun levelOrder(root: TreeNode?): List<List<Int>> {
         var localRoot: TreeNode? = root
diff --git a/src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.kt b/src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.kt
@@ -8,6 +8,16 @@ package g0101_0200.s0104_maximum_depth_of_binary_tree
 import com_github_leetcode.TreeNode
 import kotlin.math.max
 
+/*
+ * Example:
+ * var ti = TreeNode(5)
+ * var v = ti.`val`
+ * Definition for a binary tree node.
+ * class TreeNode(var `val`: Int) {
+ *     var left: TreeNode? = null
+ *     var right: TreeNode? = null
+ * }
+ */
 class Solution {
     fun maxDepth(root: TreeNode?): Int {
         return findDepth(root, 0)
diff --git a/src/main/kotlin/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.kt b/src/main/kotlin/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.kt
@@ -7,6 +7,16 @@ package g0101_0200.s0105_construct_binary_tree_from_preorder_and_inorder_travers
 import com_github_leetcode.TreeNode
 import java.util.HashMap
 
+/*
+ * Example:
+ * var ti = TreeNode(5)
+ * var v = ti.`val`
+ * Definition for a binary tree node.
+ * class TreeNode(var `val`: Int) {
+ *     var left: TreeNode? = null
+ *     var right: TreeNode? = null
+ * }
+ */
 class Solution {
     private var j = 0
     private val map: MutableMap<Int, Int> = HashMap()
diff --git a/src/main/kotlin/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.kt b/src/main/kotlin/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.kt
@@ -1,10 +1,20 @@
 package g0101_0200.s0114_flatten_binary_tree_to_linked_list
 
 // #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Stack #Linked_List
-// #Udemy_Linked_List #2022_09_03_Time_305_ms_(26.30%)_Space_35.6_MB_(59.42%)
+// #Udemy_Linked_List #2022_09_27_Time_191_ms_(93.10%)_Space_35_MB_(97.70%)
 
 import com_github_leetcode.TreeNode
 
+/*
+ * Example:
+ * var ti = TreeNode(5)
+ * var v = ti.`val`
+ * Definition for a binary tree node.
+ * class TreeNode(var `val`: Int) {
+ *     var left: TreeNode? = null
+ *     var right: TreeNode? = null
+ * }
+ */
 class Solution {
     fun flatten(root: TreeNode?) {
         if (root != null) {
diff --git a/src/main/kotlin/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.kt b/src/main/kotlin/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.kt
@@ -6,6 +6,16 @@ package g0101_0200.s0124_binary_tree_maximum_path_sum
 
 import com_github_leetcode.TreeNode
 
+/*
+ * Example:
+ * var ti = TreeNode(5)
+ * var v = ti.`val`
+ * Definition for a binary tree node.
+ * class TreeNode(var `val`: Int) {
+ *     var left: TreeNode? = null
+ *     var right: TreeNode? = null
+ * }
+ */
 class Solution {
     private var max = Int.MIN_VALUE
     private fun helper(root: TreeNode?): Int {
diff --git a/src/main/kotlin/g0201_0300/s0226_invert_binary_tree/Solution.kt b/src/main/kotlin/g0201_0300/s0226_invert_binary_tree/Solution.kt
@@ -6,6 +6,16 @@ package g0201_0300.s0226_invert_binary_tree
 
 import com_github_leetcode.TreeNode
 
+/*
+ * Example:
+ * var ti = TreeNode(5)
+ * var v = ti.`val`
+ * Definition for a binary tree node.
+ * class TreeNode(var `val`: Int) {
+ *     var left: TreeNode? = null
+ *     var right: TreeNode? = null
+ * }
+ */
 class Solution {
     fun invertTree(root: TreeNode?): TreeNode? {
         if (root == null) {
diff --git a/src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.kt b/src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.kt
@@ -6,6 +6,16 @@ package g0201_0300.s0236_lowest_common_ancestor_of_a_binary_tree
 
 import com_github_leetcode.TreeNode
 
+/*
+ * Example:
+ * var ti = TreeNode(5)
+ * var v = ti.`val`
+ * Definition for a binary tree node.
+ * class TreeNode(var `val`: Int) {
+ *     var left: TreeNode? = null
+ *     var right: TreeNode? = null
+ * }
+ */
 class Solution {
     fun lowestCommonAncestor(root: TreeNode?, p: TreeNode, q: TreeNode): TreeNode? {
         if (root == null) {
diff --git a/src/main/kotlin/g0301_0400/s0338_counting_bits/Solution.kt b/src/main/kotlin/g0301_0400/s0338_counting_bits/Solution.kt
@@ -1,15 +1,15 @@
 package g0301_0400.s0338_counting_bits
 
 // #Easy #Top_100_Liked_Questions #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation
-// #2022_09_16_Time_413_ms_(26.03%)_Space_45.2_MB_(34.93%)
+// #2022_09_27_Time_186_ms_(99.26%)_Space_38.8_MB_(89.71%)
 
 class Solution {
     fun countBits(num: Int): IntArray {
         val result = IntArray(num + 1)
         var borderPos = 1
         var incrPos = 1
         for (i in 1 until result.size) {
-            // when we reach pow of 2 ,  reset borderPos and incrPos
+            // when we reach pow of 2, reset borderPos and incrPos
             if (incrPos == borderPos) {
                 result[i] = 1
                 incrPos = 1
diff --git a/src/main/kotlin/g0301_0400/s0394_decode_string/Solution.kt b/src/main/kotlin/g0301_0400/s0394_decode_string/Solution.kt
@@ -1,7 +1,7 @@
 package g0301_0400.s0394_decode_string
 
 // #Medium #Top_100_Liked_Questions #String #Stack #Recursion #Level_1_Day_14_Stack #Udemy_Strings
-// #2022_09_11_Time_268_ms_(23.13%)_Space_33.9_MB_(97.01%)
+// #2022_09_27_Time_224_ms_(64.86%)_Space_34.3_MB_(84.46%)
 
 class Solution {
     private var i = 0

Original file line number	Diff line number	Diff line change
`@@ -39,7 +39,7 @@ class Solution {`
`39`	`39`	`}`
`40`	`40`
`41`	`41`	`private fun insert(dest: TreeNode?, n: TreeNode, from: TreeNode) {`
`42`		- if (dest != null && dest.`val` === from.`val`) {
	`42`	+ if (dest != null && dest.`val` == from.`val`) {
`43`	`43`	`val h: TreeNode? = dest.right`
`44`	`44`	`dest.right = n`
`45`	`45`	`n.left = h`
`@@ -53,6 +53,6 @@ class Solution {`
`53`	`53`	`private fun copy(n: TreeNode?): TreeNode? {`
`54`	`54`	`return if (n == null) {`
`55`	`55`	`null`
`56`		- } else TreeNode(n.`val`, copy(n.left), copy(n.right))
	`56`	+ } else { TreeNode(n.`val`, copy(n.left), copy(n.right)) }
`57`	`57`	`}`
`58`	`58`	`}`