FilesExpand file tree

 main

/

Reordered_Power_of_2.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

20 lines (16 loc) · 661 Bytes

 main

/

Reordered_Power_of_2.py

Copy path

Top

File metadata and controls

• Code
• Blame

20 lines (16 loc) · 661 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

# Problem link: https://leetcode.com/problems/reordered-power-of-2/

import math

class Solution:

def reorderedPowerOf2(self, N: int) -> bool:

"""

Returns true if any reordering (including the original) of an integer N results in a power of 2

The reordering must not contain zeroes as leading digits

"""

N_string = str(N)

log2 = math.log10(2)

min_power = math.ceil((len(N_string) - 1) / log2)

max_power = math.floor(len(N_string) / log2)

for p in range(min_power, max_power + 1):

if set(str(2 ** p)) == set(N_string):

return True

return False