Fixed idea warnings

Author: javadev

src/main/java/g0201_0300/s0282_expression_add_operators/Solution.java

@@ -9,7 +9,7 @@
 public class Solution {
     public List<String> addOperators(String num, int target) {
         List<String> res = new ArrayList<>();
-        if (num.length() == 0 || Long.valueOf(num) > Integer.MAX_VALUE) {
+        if (num.length() == 0 || Long.parseLong(num) > Integer.MAX_VALUE) {
             return res;
         }
         char[] list = num.toCharArray();

src/main/java/g0301_0400/s0400_nth_digit/Solution.java

@@ -13,7 +13,7 @@ public int findNthDigit(int n) {
         long count = 9;
         int start = 1;
         while (n > len * count) {
-            n -= len * count;
+            n -= (int) (len * count);
             len += 1;
             count *= 10;
             start *= 10;

src/main/java/g0401_0500/s0419_battleships_in_a_board/Solution.java

@@ -13,7 +13,7 @@ public int countBattleships(char[][] board) {
         for (int i = 0; i < m; i++) {
             for (int j = 0; j < n; j++) {
                 if (board[i][j] != '.'
-                        && (j <= 0 || board[i][j - 1] != 'X')
+                        && (j == 0 || board[i][j - 1] != 'X')
                         && (i <= 0 || board[i - 1][j] != 'X')) {
                     count++;
                 }

src/main/java/g0801_0900/s0880_decoded_string_at_index/Solution.java

@@ -15,7 +15,7 @@ public String decodeAtIndex(String s, int k) {
         }
         for (int i = s.length() - 1; i >= 0; i--) {
             char c = s.charAt(i);
-            k %= length;
+            k %= (int) length;
             if (c >= 48 && c <= 57) {
                 length /= c - '0';
             } else if (k == 0) {

src/main/java/g1001_1100/s1009_complement_of_base_10_integer/Solution.java

@@ -20,7 +20,7 @@ public int bitwiseComplement(int n) {
         int exp = list.size() - 1;
         for (int i = list.size() - 1; i >= 0; i--) {
             if (list.get(i) == 0) {
-                result += Math.pow(2, exp);
+                result += (int) Math.pow(2, exp);
             }
             exp--;
         }

src/main/java/g1101_1200/s1195_fizz_buzz_multithreaded/FizzBuzz.java

@@ -16,7 +16,7 @@ public FizzBuzz(int n) {
     }
 
     // printFizz.run() outputs "fizz".
-    public void fizz(Runnable printFizz) throws InterruptedException {
+    public void fizz(Runnable printFizz) {
         int i;
         while ((i = count.get()) <= n) {
             if (i % 3 == 0 && i % 5 != 0) {
@@ -27,7 +27,7 @@ public void fizz(Runnable printFizz) throws InterruptedException {
     }
 
     // printBuzz.run() outputs "buzz".
-    public void buzz(Runnable printBuzz) throws InterruptedException {
+    public void buzz(Runnable printBuzz) {
         int i;
         while ((i = count.get()) <= n) {
             count.get();
@@ -39,7 +39,7 @@ public void buzz(Runnable printBuzz) throws InterruptedException {
     }
 
     // printFizzBuzz.run() outputs "fizzbuzz".
-    public void fizzbuzz(Runnable printFizzBuzz) throws InterruptedException {
+    public void fizzbuzz(Runnable printFizzBuzz) {
         int i;
         while ((i = count.get()) <= n) {
             if (i % 15 == 0) {
@@ -50,7 +50,7 @@ public void fizzbuzz(Runnable printFizzBuzz) throws InterruptedException {
     }
 
     // printNumber.accept(x) outputs "x", where x is an integer.
-    public void number(IntConsumer printNumber) throws InterruptedException {
+    public void number(IntConsumer printNumber) {
         int i;
         while ((i = count.get()) <= n) {
             if (i % 5 != 0 && i % 3 != 0) {

src/main/java/g1201_1300/s1286_iterator_for_combination/CombinationIterator.java

@@ -10,13 +10,12 @@ public class CombinationIterator {
     private List<String> list;
     private int index;
     private int combinationLength;
-    private boolean[] visited;
 
     public CombinationIterator(String characters, int combinationLength) {
         this.index = 0;
         this.list = new ArrayList<>();
         this.combinationLength = combinationLength;
-        this.visited = new boolean[characters.length()];
+        boolean[] visited = new boolean[characters.length()];
         buildAllCombinations(characters, 0, new StringBuilder(), visited);
     }
 

src/main/java/g1301_1400/s1354_construct_target_array_with_multiple_sums/Solution.java

@@ -21,7 +21,7 @@ public boolean isPossible(int[] target) {
                 || target[maxIndex] % remainingSum == 0) {
             return false;
         }
-        target[maxIndex] %= remainingSum;
+        target[maxIndex] %= (int) remainingSum;
         return isPossible(target);
     }
 }

src/main/java/g1501_1600/s1519_number_of_nodes_in_the_sub_tree_with_the_same_label/Solution.java

@@ -8,7 +8,7 @@
 public class Solution {
     public int[] countSubTrees(int n, int[][] edges, String labelsString) {
         int[] labelsCount = new int[n];
-        if (n <= 0 || edges == null || labelsString == null) {
+        if (n == 0 || edges == null || labelsString == null) {
             return labelsCount;
         }
 

src/main/java/g1601_1700/s1648_sell_diminishing_valued_colored_balls/Solution.java

@@ -18,7 +18,7 @@ public int maxProfit(int[] inventory, int orders) {
                 long diff = i == 0 ? inventory[i] : inventory[i] - inventory[i - 1];
                 if (count * diff < orders) {
                     totalValue += (2L * inventory[i] - diff + 1) * diff * count / 2 % mod;
-                    orders -= count * diff;
+                    orders -= (int) (count * diff);
                 } else {
                     diff = orders / count;
                     long remainder = orders % count;