Fixed idea warnings.

Author: javadev

src/main/java/g0501_0600/s0504_base_7/Solution.java

@@ -4,6 +4,6 @@
 
 public class Solution {
     public String convertToBase7(int num) {
-        return String.valueOf(Integer.toString(num, 7));
+        return Integer.toString(num, 7);
     }
 }

src/main/java/g0501_0600/s0541_reverse_string_ii/Solution.java

@@ -19,7 +19,7 @@ public String reverseStr(String s, int k) {
                 if (s.length() < p2 + 1) {
                     res.append(s.substring(p1 + k));
                 } else {
-                    res.append(s.substring(p1 + k, p2 + 1));
+                    res.append(s, p1 + k, p2 + 1);
                 }
             }
             p1 = p1 + 2 * k;

src/main/java/g0501_0600/s0592_fraction_addition_and_subtraction/Solution.java

@@ -12,7 +12,7 @@ private int gcd(int a, int b) {
 
     private String format(int a, int b) {
         int gcd = Math.abs(gcd(a, b));
-        return String.valueOf(a / gcd) + "/" + (b / gcd);
+        return a / gcd + "/" + (b / gcd);
     }
 
     private int[] parse(String s) {

src/main/java/g0701_0800/s0770_basic_calculator_iv/Solution.java

@@ -50,8 +50,7 @@ public List<String> basicCalculatorIV(String expression, String[] evalvars, int[
                 output.add("" + expr.terms.get(term) + (term.equals("") ? "" : "*" + term));
             }
         }
-        Collections.sort(
-                output,
+        output.sort(
                 (a, b) -> {
                     int aStar = 0;
                     int bStar = 0;

src/main/java/g0801_0900/s0808_soup_servings/Solution.java

@@ -34,20 +34,4 @@ private double find(int a, int b, Double[][] mem) {
         mem[a][b] = 0.25 * prob;
         return mem[a][b];
     }
-
-    private double find(int a, int b) {
-        if (a <= 0 && b <= 0) {
-            return 0.5;
-        } else if (a <= 0) {
-            return 1;
-        } else if (b <= 0) {
-            return 0;
-        }
-        double prob;
-        prob = find(a - 100, b);
-        prob += find(a - 75, b - 25);
-        prob += find(a - 50, b - 50);
-        prob += find(a - 25, b - 75);
-        return 0.25 * prob;
-    }
 }

src/main/java/g0801_0900/s0820_short_encoding_of_words/Solution.java

@@ -5,13 +5,8 @@
 import java.util.Arrays;
 
 public class Solution {
-    static class Node {
-        char c;
+    private static class Node {
         Node[] nodes = new Node[26];
-
-        public Node(char c) {
-            this.c = c;
-        }
     }
 
     private boolean insert(Node node, String word) {
@@ -20,7 +15,7 @@ private boolean insert(Node node, String word) {
         boolean flag = false;
         for (int i = n - 1; i >= 0; i--) {
             if (current.nodes[word.charAt(i) - 'a'] == null) {
-                current.nodes[word.charAt(i) - 'a'] = new Node(word.charAt(i));
+                current.nodes[word.charAt(i) - 'a'] = new Node();
                 flag = true;
             }
             current = current.nodes[word.charAt(i) - 'a'];
@@ -31,7 +26,7 @@ private boolean insert(Node node, String word) {
     public int minimumLengthEncoding(String[] words) {
         int out = 0;
         Arrays.sort(words, (a, b) -> b.length() - a.length());
-        Node node = new Node('/');
+        Node node = new Node();
         for (String word : words) {
             if (insert(node, word)) {
                 out = out + word.length() + 1;

src/main/java/g0801_0900/s0824_goat_latin/Solution.java

@@ -12,7 +12,7 @@ public String toGoatLatin(String sentence) {
                 sb.append(word).append("ma");
             } else {
                 char firstChar = word.charAt(0);
-                sb.append(word.substring(1, word.length())).append(firstChar).append("ma");
+                sb.append(word.substring(1)).append(firstChar).append("ma");
             }
             a.append("a");
             sb.append(a);

src/main/java/g1001_1100/s1089_duplicate_zeros/Solution.java

@@ -16,19 +16,15 @@ public void duplicateZeros(int[] arr) {
         int i = arr.length - 1;
         int j = len - 1;
         while (i < j) {
-            if (arr[i] != 0) {
-                if (j < arr.length) {
-                    arr[j] = arr[i];
-                }
-            } else {
+            // copy twice when hit '0'
+            if (arr[i] == 0) {
                 if (j < arr.length) {
                     arr[j] = arr[i];
                 }
                 j--;
-                if (j < arr.length) {
-                    // copy twice when hit '0'
-                    arr[j] = arr[i];
-                }
+            }
+            if (j < arr.length) {
+                arr[j] = arr[i];
             }
             i--;
             j--;