Fixed style

Author: javadev

src/main/java/g3101_3200/s3115_maximum_prime_difference/Solution.java

@@ -6,25 +6,25 @@ public class Solution {
     public int maximumPrimeDifference(int[] nums) {
         int n = nums.length;
         int i = 0;
-        while (i < n && !check(nums[i])) {
+        while (i < n && check(nums[i])) {
             i++;
         }
         int j = n - 1;
-        while (j >= 0 && !check(nums[j])) {
+        while (j >= 0 && check(nums[j])) {
             j--;
         }
         return j - i;
     }
 
     private boolean check(int n) {
         if (n < 2) {
-            return false;
+            return true;
         }
         for (int i = 2; i <= Math.sqrt(n); i++) {
             if (n % i == 0) {
-                return false;
+                return true;
             }
         }
-        return true;
+        return false;
     }
 }