Fixed sonar warnings, updated readme.

Author: javadev

README.md

@@ -2,6 +2,7 @@
 
 // #Medium #Array #Dynamic_Programming #Math #2022_07_10_Time_16_ms_(96.57%)_Space_42.3_MB_(64.43%)
 
+@SuppressWarnings("java:S3012")
 public class Solution {
     public int nthSuperUglyNumber(int n, int[] primes) {
         long[] primes1 = new long[primes.length];

src/main/java/g0301_0400/s0313_super_ugly_number/Solution.java

@@ -3,14 +3,15 @@
 // #Hard #String #Dynamic_Programming #Breadth_First_Search #Memoization
 // #2022_07_13_Time_1989_ms_(32.79%)_Space_56.5_MB_(81.97%)
 
+import java.util.ArrayDeque;
+import java.util.Deque;
 import java.util.HashMap;
-import java.util.Stack;
 
 public class Solution {
     private HashMap<String, Integer> map = new HashMap<>();
 
     private String removeConsecutiveThreeOrMoreBalls(String board) {
-        Stack<Character> st = new Stack<>();
+        Deque<Character> st = new ArrayDeque<>();
         int n = board.length();
         for (int i = 0; i < n; i++) {
             char ch = board.charAt(i);

src/main/java/g0401_0500/s0488_zuma_game/Solution.java

@@ -22,7 +22,7 @@ public int uniqueLetterString(String s) {
         prevLastCharIdx[s.charAt(0) - 'A'] = 0;
         for (int i = 1; i < len; i++) {
             char ch = s.charAt(i);
-            int chIdx = (int) (ch - 'A');
+            int chIdx = ch - 'A';
             int lastSeenIdx = lastCharIdx[chIdx];
             int prevLastIdx = prevLastCharIdx[chIdx];
             dp[i] = dp[i - 1] + 1;

src/main/java/g0801_0900/s0828_count_unique_characters_of_all_substrings_of_a_given_string/Solution.java

@@ -4,20 +4,21 @@
 // #2022_07_14_Time_11_ms_(51.18%)_Space_52.7_MB_(22.45%)
 
 import java.util.HashMap;
+import java.util.Map;
 
 public class Solution {
     public boolean hasGroupsSizeX(int[] deck) {
         HashMap<Integer, Integer> hmap = new HashMap<>();
-        for (int i = 0; i < deck.length; i++) {
-            if (hmap.containsKey(deck[i])) {
-                hmap.put(deck[i], hmap.get(deck[i]) + 1);
+        for (int j : deck) {
+            if (hmap.containsKey(j)) {
+                hmap.put(j, hmap.get(j) + 1);
             } else {
-                hmap.put(deck[i], 1);
+                hmap.put(j, 1);
             }
         }
         int x = hmap.get(deck[0]);
-        for (Integer i : hmap.keySet()) {
-            x = gcd(x, hmap.get(i));
+        for (Map.Entry<Integer, Integer> entry : hmap.entrySet()) {
+            x = gcd(x, entry.getValue());
         }
         return x >= 2;
     }

src/main/java/g0901_1000/s0914_x_of_a_kind_in_a_deck_of_cards/Solution.java

@@ -55,7 +55,7 @@ public List<TreeNode> delNodes(TreeNode root, int[] localToDelete) {
         }
         nodes.add(root);
         List<TreeNode> forests = new ArrayList<>();
-        while (nodes.size() > 0) {
+        while (!nodes.isEmpty()) {
             TreeNode node = nodes.poll();
             node = deleteAndSplit(node);
             if (node != null) {

src/main/java/g1101_1200/s1110_delete_nodes_and_return_forest/Solution.java

@@ -3,28 +3,29 @@
 // #Easy #Array #Matrix #Simulation #2022_07_10_Time_6_ms_(89.10%)_Space_54.8_MB_(44.55%)
 
 import java.util.ArrayList;
+import java.util.Collections;
 import java.util.List;
 
 public class Solution {
     public List<List<Integer>> shiftGrid(int[][] grid, int k) {
         if (grid == null) {
-            return null;
+            return Collections.emptyList();
         }
         int[] flat = new int[grid.length * grid[0].length];
         int index = 0;
-        for (int i = 0; i < grid.length; ++i) {
+        for (int[] ints : grid) {
             for (int j = 0; j < grid[0].length; ++j) {
-                flat[index++] = grid[i][j];
+                flat[index++] = ints[j];
             }
         }
         int mode = k % flat.length;
         int readingIndex = flat.length - mode;
         if (readingIndex == flat.length) {
             readingIndex = 0;
         }
-        List<List<Integer>> result = new ArrayList<List<Integer>>();
+        List<List<Integer>> result = new ArrayList<>();
         for (int i = 0; i < grid.length; ++i) {
-            List<Integer> eachRow = new ArrayList<Integer>();
+            List<Integer> eachRow = new ArrayList<>();
             for (int j = 0; j < grid[0].length; ++j) {
                 eachRow.add(flat[readingIndex++]);
                 if (readingIndex == flat.length) {