[JAVA] Simplest solution so far | NO bitwise
\npublic boolean reorderedPowerOf2(int n) {\n        char[] num = String.valueOf(n).toCharArray();\n        Arrays.sort(num);\n        for(int i=0;i<30;i++){\n 
```\npublic boolean reorderedPowerOf2(int n) {\n        char[] num = String.valueOf(n).toCharArray();\n        Arrays.sort(num);\n        for(int i=0;i<30;i++){\n            int intCur = (int)Math.pow(2,i);\n            char[] charCur = String.valueOf(intCur).toCharArray();\n            Arrays.sort(charCur);\n            if(Arrays.equals(num,charCur))\n                return true;\n        }\n        return false;\n    }\n```
['Sorting', 'Java']