Fixed sonar warnings

Author: javadev

src/main/kotlin/com_github_leetcode/NestedInteger.kt

@@ -1,5 +1,6 @@
 package com_github_leetcode
 
+@Suppress("kotlin:S6512")
 class NestedInteger {
     private var list: MutableList<NestedInteger>? = null
     private var integer: Int? = null

src/main/kotlin/g0201_0300/s0211_design_add_and_search_words_data_structure/WordDictionary.kt

@@ -25,16 +25,16 @@ class WordDictionary {
         fun dfs(p: TrieNode?, start: Int): Boolean {
             if (p == null) return false
             if (start == word.length) return p.isWord
-            if (word[start] == '.') {
+            return if (word[start] == '.') {
                 for (i in 0..25) {
                     if (dfs(p.children[i], start + 1)) {
                         return true
                     }
                 }
-                return false
+                false
             } else {
                 val i = word[start] - 'a'
-                return dfs(p.children[i], start + 1)
+                dfs(p.children[i], start + 1)
             }
         }
         return dfs(trieTree, 0)

src/main/kotlin/g0301_0400/s0347_top_k_frequent_elements/Solution.kt

@@ -8,6 +8,7 @@ package g0301_0400.s0347_top_k_frequent_elements
 import java.util.PriorityQueue
 import java.util.Queue
 
+@Suppress("kotlin:S6518")
 class Solution {
     fun topKFrequent(nums: IntArray, k: Int): IntArray {
         nums.sort()

src/main/kotlin/g0301_0400/s0381_insert_delete_getrandom_o1_duplicates_allowed/RandomizedCollection.kt

@@ -13,13 +13,13 @@ class RandomizedCollection() {
     fun insert(x: Int): Boolean {
         a2m.add(x)
         val pos = a2m.size - 1
-        if (x in m2a) {
+        return if (x in m2a) {
             m2a[x]!!.add(pos)
-            return false
+            false
         } else {
             m2a[x] = HashSet<Int>()
             m2a[x]!!.add(pos)
-            return true
+            true
         }
     }
 

src/main/kotlin/g0301_0400/s0399_evaluate_division/Solution.kt

@@ -3,9 +3,11 @@ package g0301_0400.s0399_evaluate_division
 // #Medium #Array #Depth_First_Search #Breadth_First_Search #Graph #Union_Find #Shortest_Path
 // #2022_11_29_Time_183_ms_(91.49%)_Space_34.6_MB_(95.74%)
 
+@Suppress("kotlin:S6518")
 class Solution {
     private var root: MutableMap<String?, String?>? = null
     private var rate: MutableMap<String?, Double>? = null
+
     fun calcEquation(
         equations: List<List<String?>>,
         values: DoubleArray,

src/main/kotlin/g0501_0600/s0508_most_frequent_subtree_sum/Solution.kt

@@ -28,12 +28,12 @@ class Solution {
     }
 
     private fun treeSum(node: TreeNode?): Int {
-        if (node == null) {
-            return 0
+        return if (node == null) {
+            0
         } else {
             val sum = node.`val` + treeSum(node.left) + treeSum(node.right)
             cache[sum] = cache.getOrDefault(sum, 0) + 1
-            return sum
+            sum
         }
     }
 }

src/main/kotlin/g0601_0700/s0641_design_circular_deque/MyCircularDeque.kt

@@ -3,6 +3,7 @@ package g0601_0700.s0641_design_circular_deque
 // #Medium #Array #Design #Linked_List #Queue
 // #2023_02_10_Time_232_ms_(100.00%)_Space_37.5_MB_(83.33%)
 
+@Suppress("kotlin:S6512")
 class MyCircularDeque(k: Int) {
     private val data: IntArray
     private var front: Int

src/main/kotlin/g0601_0700/s0692_top_k_frequent_words/Solution.kt

@@ -16,10 +16,10 @@ class Solution {
         }
         val sortedset: SortedSet<Map.Entry<String, Int>> = TreeSet(
             java.util.Comparator { (key, value): Map.Entry<String, Int>, (key1, value1): Map.Entry<String, Int> ->
-                if (value != value1) {
-                    return@Comparator value1 - value
+                return@Comparator if (value != value1) {
+                    value1 - value
                 } else {
-                    return@Comparator key.compareTo(key1, ignoreCase = true)
+                    key.compareTo(key1, ignoreCase = true)
                 }
             }
         )

src/main/kotlin/g0801_0900/s0843_guess_the_word/Solution.kt

@@ -11,7 +11,7 @@ package g0801_0900.s0843_guess_the_word
  * }
  */
 class Solution {
-    interface Master {
+    fun interface Master {
         fun guess(word: String): Int
     }