Time: 3 ms (48.57%), Space: 43.7 MB (97.48%) - LeetHub

py3-coder · py3-coder · commit d9c7181ab0b0 · 2024-11-06T14:49:15.000+05:30
diff --git a/3011-find-if-array-can-be-sorted/3011-find-if-array-can-be-sorted.java b/3011-find-if-array-can-be-sorted/3011-find-if-array-can-be-sorted.java
@@ -0,0 +1,21 @@
+class Solution {
+    public boolean canSortArray(int[] nums) {int n=nums.length;
+        for(int i=0;i<n;i++){
+            for(int j=i+1;j<n;j++){
+                if(nums[j]<nums[i]){
+                    if(Integer.bitCount(nums[i])==
+                    Integer.bitCount(nums[j])){
+                        int temp=nums[i];
+                        nums[i]=nums[j];
+                        nums[j]=temp;
+                    }
+                    else return false;
+                }
+            }
+        }
+        for(int i=1;i<=n-1;i++){
+            if(nums[i]<nums[i-1]) return false;
+        }
+        return true;
+    }
+}
