Fixed idea warnings.

Author: javadev

src/main/java/g0701_0800/s0730_count_different_palindromic_subsequences/Solution.java

@@ -16,18 +16,16 @@ public int countPalindromicSubsequences(String s) {
             dp[i][i] = 1;
             int l2 = -1;
             for (int j = i - 1; j >= 0; j--) {
-                if (s.charAt(j) != c) {
-                    dp[j][i] = deal(dp[j][i - 1] + deta, big);
-                } else {
+                if (s.charAt(j) == c) {
                     if (l2 < 0) {
                         l2 = j;
                         deta = dp[j + 1][i - 1] + 1;
                     } else {
                         deta = dp[j + 1][i - 1] - dp[j + 1][l2 - 1];
                     }
                     deta = deal(deta, big);
-                    dp[j][i] = deal(dp[j][i - 1] + deta, big);
                 }
+                dp[j][i] = deal(dp[j][i - 1] + deta, big);
             }
         }
         return deal(dp[0][len - 1], big);

src/main/java/g0701_0800/s0783_minimum_distance_between_bst_nodes/Solution.java

@@ -28,12 +28,10 @@ public int minDiffInBST(TreeNode root) {
             return min;
         }
         minDiffInBST(root.left);
-        if (prev == -1) {
-            prev = root.val;
-        } else {
+        if (prev != -1) {
             min = Math.min(min, Math.abs(root.val - prev));
-            prev = root.val;
         }
+        prev = root.val;
         minDiffInBST(root.right);
         return min;
     }