refactor format

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_628.java

@@ -24,11 +24,11 @@ public int maximumProduct(int[] nums) {
         Arrays.sort(nums);
         int product = 1;
         if (nums.length >= 3) {
-            for (int i = nums.length-1; i >= nums.length-3; i--) {
+            for (int i = nums.length - 1; i >= nums.length - 3; i--) {
                 product *= nums[i];
             }
             int anotherProduct = nums[0] * nums
-                    [1] * nums[nums.length-1];
+                    [1] * nums[nums.length - 1];
             product = Math.max(product, anotherProduct);
         } else {
             for (int i = 0; i < nums.length; i++) {
@@ -42,7 +42,7 @@ public static void main(String... args) {
         _628 test = new _628();
 //        int[] nums = new int[]{1,2,3};
 //        int[] nums = new int[]{1,2,3,4};
-        int[] nums = new int[]{-4,-3,-2,-1,60};
+        int[] nums = new int[]{-4, -3, -2, -1, 60};
         System.out.println(test.maximumProduct(nums));
     }
 }

src/main/java/com/fishercoder/solutions/_629.java

@@ -30,23 +30,23 @@ public class _629 {
      * https://discuss.leetcode.com/topic/93815/java-dp-o-nk-solution*/
     public int kInversePairs(int n, int k) {
         int mod = 1000000007;
-        if (k > n*(n-1)/2 || k < 0) {
+        if (k > n * (n - 1) / 2 || k < 0) {
             return 0;
         }
-        if (k == 0 || k == n*(n-1)/2) {
+        if (k == 0 || k == n * (n - 1) / 2) {
             return 1;
         }
-        long[][] dp = new long[n+1][k+1];
+        long[][] dp = new long[n + 1][k + 1];
         dp[2][0] = 1;
         dp[2][1] = 1;
         for (int i = 3; i <= n; i++) {
             dp[i][0] = 1;
-            for (int j = 1; j <= Math.min(k, i*(i-1)/2); j++) {
-                dp[i][j] = dp[i][j-1] + dp[i-1][j];
+            for (int j = 1; j <= Math.min(k, i * (i - 1) / 2); j++) {
+                dp[i][j] = dp[i][j - 1] + dp[i - 1][j];
                 if (j >= i) {
-                    dp[i][j] -= dp[i-1][j-i];
+                    dp[i][j] -= dp[i - 1][j - i];
                 }
-                dp[i][j] = (dp[i][j]+mod) % mod;
+                dp[i][j] = (dp[i][j] + mod) % mod;
             }
         }
         return (int) dp[n][k];

src/main/java/com/fishercoder/solutions/_647.java

@@ -28,7 +28,7 @@ public int countSubstrings(String s) {
         int count = 0;
         for (int i = 0; i < s.length(); i++) {
             count += extendPalindrome(s, i, i);//odd length
-            count += extendPalindrome(s, i, i+1);//even length
+            count += extendPalindrome(s, i, i + 1);//even length
         }
         return count;
     }

src/main/java/com/fishercoder/solutions/_651.java

@@ -44,11 +44,11 @@ public class _651 {
      * That's why we have j = 3 in the inner for loop below.
      * */
     public int maxA(int N) {
-        int[] dp = new int[N+1];
+        int[] dp = new int[N + 1];
         for (int i = 1; i <= N; i++) {
             dp[i] = i;
             for (int j = 3; j < i; j++) {
-                dp[i] = Math.max(dp[i], dp[i-j] * (j-1));
+                dp[i] = Math.max(dp[i], dp[i - j] * (j - 1));
             }
         }
         return dp[N];

src/test/java/com/fishercoder/_648Test.java

@@ -18,27 +18,27 @@ public class _648Test {
     private static String sentence;
 
     @BeforeClass
-    public static void setup(){
+    public static void setup() {
         test = new _648();
     }
 
     @Test
-    public void test1(){
+    public void test1() {
         dict = Arrays.asList("cat", "bat", "rat");
         sentence = "the cattle was rattled by the battery";
         assertEquals("the cat was rat by the bat", test.replaceWords(dict, sentence));
     }
 
     @Test
-    public void test2(){
-        dict = Arrays.asList("e","k","c","harqp","h","gsafc","vn","lqp","soy","mr","x",
-                "iitgm","sb","oo","spj","gwmly","iu","z","f","ha","vds",
-                "v","vpx","fir","t","xo","apifm","tlznm","kkv","nxyud","j",
-                "qp","omn","zoxp","mutu","i","nxth","dwuer","sadl","pv","w",
-                "mding","mubem","xsmwc","vl","farov","twfmq","ljhmr","q","bbzs",
-                "kd","kwc","a","buq","sm","yi","nypa","xwz","si","amqx","iy","eb",
-                "qvgt","twy","rf","dc","utt","mxjfu","hm","trz","lzh","lref","qbx",
-                "fmemr","gil","go","qggh","uud","trnhf","gels","dfdq","qzkx","qxw");
+    public void test2() {
+        dict = Arrays.asList("e", "k", "c", "harqp", "h", "gsafc", "vn", "lqp", "soy", "mr", "x",
+                "iitgm", "sb", "oo", "spj", "gwmly", "iu", "z", "f", "ha", "vds",
+                "v", "vpx", "fir", "t", "xo", "apifm", "tlznm", "kkv", "nxyud", "j",
+                "qp", "omn", "zoxp", "mutu", "i", "nxth", "dwuer", "sadl", "pv", "w",
+                "mding", "mubem", "xsmwc", "vl", "farov", "twfmq", "ljhmr", "q", "bbzs",
+                "kd", "kwc", "a", "buq", "sm", "yi", "nypa", "xwz", "si", "amqx", "iy", "eb",
+                "qvgt", "twy", "rf", "dc", "utt", "mxjfu", "hm", "trz", "lzh", "lref", "qbx",
+                "fmemr", "gil", "go", "qggh", "uud", "trnhf", "gels", "dfdq", "qzkx", "qxw");
         sentence = "ikkbp miszkays wqjferqoxjwvbieyk gvcfldkiavww vhokchxz dvypwyb "
                 + "bxahfzcfanteibiltins ueebf lqhflvwxksi dco kddxmckhvqifbuzkhstp wc "
                 + "ytzzlm gximjuhzfdjuamhsu gdkbmhpnvy ifvifheoxqlbosfww mengfdydekwttkhbzenk wjhmmyltmeufqvcpcxg "
@@ -53,14 +53,14 @@ public void test2(){
                 + "frotscysdyclrc ckcttaceuuxzcghw pxbd oklwhcppuziixpvihihp";
         assertEquals("i miszkays w gvcfldkiavww v dvypwyb bxahfzcfanteibiltins ueebf "
                 + "lqhflvwxksi dc k w ytzzlm gximjuhzfdjuamhsu gdkbmhpnvy i mengfdydekwttkhbzenk w "
-                        + "h ldipovluo a nusquzpmnogtjkklfhta k nxzgnrveghc mpppfhzjkbucv c uwmahhqradjtf i z "
-                        + "q yzfragcextvx i i j gzixfeugj rnukjgtjpim h a x h "
-                        + "ygelddphxnbh rvjxtlqfnlmwdoezh z i bbfj mhs nenrqfkbf "
-                        + "spfpazr w c dtd c dtaxhddidfwqs bgnnoxgyynol h "
-                        + "dijhrrpnwjlju muzzrrsypzgwvblf z h q i daee r nlipyfszvxlwqw "
-                        + "yoq dewpgtcrzausqwhh q i k bqprarpgnyemzwifqzz "
-                        + "oai pnqottd nygesjtlpala q gyvukjpc s mxhlkdaycskj "
-                        + "uvwmerplaibeknltuvd ocnn f c pxbd oklwhcppuziixpvihihp", test.replaceWords(dict, sentence));
+                + "h ldipovluo a nusquzpmnogtjkklfhta k nxzgnrveghc mpppfhzjkbucv c uwmahhqradjtf i z "
+                + "q yzfragcextvx i i j gzixfeugj rnukjgtjpim h a x h "
+                + "ygelddphxnbh rvjxtlqfnlmwdoezh z i bbfj mhs nenrqfkbf "
+                + "spfpazr w c dtd c dtaxhddidfwqs bgnnoxgyynol h "
+                + "dijhrrpnwjlju muzzrrsypzgwvblf z h q i daee r nlipyfszvxlwqw "
+                + "yoq dewpgtcrzausqwhh q i k bqprarpgnyemzwifqzz "
+                + "oai pnqottd nygesjtlpala q gyvukjpc s mxhlkdaycskj "
+                + "uvwmerplaibeknltuvd ocnn f c pxbd oklwhcppuziixpvihihp", test.replaceWords(dict, sentence));
     }
 
 }