feat : add leetcode daily solution

This commit is contained in:
2025-08-13 14:22:48 +08:00
parent 3b1ffd3b14
commit 80c8ed405c
3 changed files with 53 additions and 0 deletions

View File

@@ -0,0 +1,22 @@
Given an integer n, return true if it is a power of three. Otherwise, return false.
An integer n is a power of three, if there exists an integer x such that n == 3x.
Example 1:
Input: n = 27
Output: true
Explanation: 27 = 33
Example 2:
Input: n = 0
Output: false
Explanation: There is no x where 3x = 0.
Example 3:
Input: n = -1
Output: false
Explanation: There is no x where 3x = (-1).