README.md

1780. Check if Number is a Sum of Powers of Three

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:

Input: n = 12
Output: true
Explanation: 12 = 31 + 32

Example 2:

Input: n = 91
Output: true
Explanation: 91 = 30 + 32 + 34

Example 3:

Input: n = 21
Output: false

Constraints:

• 1 <= n <= 107

Solutions (Ruby)

1. Solution

# @param {Integer} n
# @return {Boolean}
def check_powers_of_three(n)
  while n > 0
    return false if n % 3 == 2

    n /= 3
  end

  true
end

Solutions (Rust)

1. Solution

impl Solution {
    pub fn check_powers_of_three(mut n: i32) -> bool {
        while n > 0 {
            if n % 3 == 2 {
                return false;
            }
            n /= 3;
        }

        true
    }
}