[LeetCode] 1780. Check if Number is a Sum of Powers of Three (Python)
·
알고리즘/LeetCode
난이도: MediumProblem 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. Problem ExampleExample 1:Input: n = 12Output: trueExplanation: 12 = 3^1 + 3^2Example 2:Input: n = 91Output: trueExplanation: 91 = 3^0 + 3^2 + 3^4Example 3:I..