Update Solution.java

Author: javadev

src/main/java/g2501_2600/s2541_minimum_operations_to_make_array_equal_ii/Solution.java

@@ -9,15 +9,13 @@ public long minOperations(int[] nums1, int[] nums2, int k) {
         int n = nums1.length;
         long pcnt = 0;
         long ncnt = 0;
-
         if (k == 0) {
             if (Arrays.equals(nums1, nums2)) {
                 return 0;
             } else {
                 return -1;
             }
         }
-
         for (int i = 0; i < n; i++) {
             int tp = nums1[i] - nums2[i];
             if (tp % k != 0) {