Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 1780 with 48 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 1780 # by problem number
lcpy gen -s check_if_number_is_a_sum_of_powers_of_three # by problem name
n, return true if it is possible to represent n as the sum of distinct powers of three. Otherwise, return false.
An integer y is a power of three if there exists an integer x such that y == 3^x.
Input: n = 12
Output: true
Explanation: 12 = 3^1 + 3^2
Input: n = 91
Output: true
Explanation: 91 = 3^0 + 3^2 + 3^4
Input: n = 21
Output: false
class Solution:
# Time: O(log_3 n)
# Space: O(1)
def check_powers_of_three(self, n: int) -> bool:
while n > 0:
if n % 3 == 2:
return False
n //= 3
return True
| Time | Space |
|---|---|
| O(log_3 n) | O(1) |