1780. Check if Number is a Sum of Powers of Three
https://leetcode.com/problems/check-if-number-is-a-sum-of-powers-of-three
Description
Given an integer 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 == 3x
.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 107
ac
Previous1779. Find Nearest Point That Has the Same X or Y CoordinateNext1781. Sum of Beauty of All Substrings
Last updated