Time: 1 ms (100.00%), Space: 44 MB (96.03%) - LeetHub

py3-coder · py3-coder · commit ee1979e88dce · 2024-11-11T22:43:39.000+05:30
diff --git a/2601-prime-subtraction-operation/2601-prime-subtraction-operation.java b/2601-prime-subtraction-operation/2601-prime-subtraction-operation.java
@@ -0,0 +1,32 @@
+class Solution {
+      public boolean primeSubOperation(int[] nums) {
+        int[] primes = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997};
+
+        int n=nums.length;
+        int l=0, h=0;
+        for(int i=n-2; i>=0; i--){
+            if(nums[i]>=nums[i+1]){
+                l=nums[i]-(nums[i+1]-1);
+                h=nums[i];
+                int p=getPrime(primes, l, h);
+                if(p==h){
+                    return false;
+                }
+                else{
+                    nums[i]=nums[i]-p;
+                }
+            }
+        }
+
+        return true;
+    }
+
+    int getPrime(int[] primes, int l, int h){
+        for(int i=0; i<primes.length; i++){
+            if(l<=primes[i] && primes[i]<h){
+                return primes[i];
+            }
+        }
+        return h;
+    }
+}
