feat: leetcode 1780

Author: deweyou

README.md

@@ -2,7 +2,7 @@
 
 <p align="center">
 <!-- TOPICS COUNT START -->
-<img src="https://img.shields.io/badge/-进度:566-green" alt="进度:566">
+<img src="https://img.shields.io/badge/-进度:567-green" alt="进度:567">
 <!-- TOPICS COUNT END -->
 <a href="./assets/docs/TOPICS.md"><img src="https://img.shields.io/badge/-题库目录-blue" alt="题库目录"></a>
 <a href="./assets/docs/CATEGORIES.md"><img src="https://img.shields.io/badge/-题库分类-red" alt="题库分类"></a>

assets/data/categories.json

@@ -1395,6 +1395,12 @@
         "path": "./problemset/determine-if-string-halves-are-alike/README.md",
         "difficulty": "简单"
       },
+      {
+        "id": "1780",
+        "title": "判断一个数字是否可以表示成三的幂的和",
+        "path": "./problemset/check-if-number-is-a-sum-of-powers-of-three/README.md",
+        "difficulty": "中等"
+      },
       {
         "id": "1784",
         "title": "检查二进制字符串字段",

assets/data/topics.json

@@ -5239,6 +5239,16 @@
     "url": "https://leetcode.cn/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate/",
     "path": "./problemset/find-nearest-point-that-has-the-same-x-or-y-coordinate/README.md"
   },
+  {
+    "id": "1780",
+    "title": {
+      "cn": "判断一个数字是否可以表示成三的幂的和",
+      "en": "check-if-number-is-a-sum-of-powers-of-three"
+    },
+    "difficulty": "中等",
+    "url": "https://leetcode.cn/problems/check-if-number-is-a-sum-of-powers-of-three/",
+    "path": "./problemset/check-if-number-is-a-sum-of-powers-of-three/README.md"
+  },
   {
     "id": "1784",
     "title": {
@@ -5659,4 +5669,4 @@
     "url": "https://leetcode.cn/problems/zero-matrix-lcci/",
     "path": "./problemset/zero-matrix-lcci/README.md"
   }
-]
+]

assets/docs/CATEGORIES.md

@@ -257,6 +257,7 @@
 | 1175. [质数排列](../../problemset/prime-arrangements/README.md) | 简单 |
 | 1447. [最简分数](../../problemset/simplified-fractions/README.md) | 中等 |
 | 1704. [判断字符串的两半是否相似](../../problemset/determine-if-string-halves-are-alike/README.md) | 简单 |
+| 1780. [判断一个数字是否可以表示成三的幂的和](../../problemset/check-if-number-is-a-sum-of-powers-of-three/README.md) | 中等 |
 | 1784. [检查二进制字符串字段](../../problemset/check-if-binary-string-has-at-most-one-segment-of-ones/README.md) | 简单 |
 | 1791. [找出星型图的中心节点](../../problemset/find-center-of-star-graph/README.md) | 简单 |
 | 1812. [判断国际象棋棋盘中一个格子的颜色](../../problemset/determine-color-of-a-chessboard-square/README.md) | 简单 |

assets/docs/TOPICS.md

@@ -1048,6 +1048,8 @@
 
 [1779. 找到最近的有相同 X 或 Y 坐标的点](../../problemset/find-nearest-point-that-has-the-same-x-or-y-coordinate/README.md)
 
+[1780. 判断一个数字是否可以表示成三的幂的和](../../problemset/check-if-number-is-a-sum-of-powers-of-three/README.md)
+
 [1784. 检查二进制字符串字段](../../problemset/check-if-binary-string-has-at-most-one-segment-of-ones/README.md)
 
 [1790. 仅执行一次字符串交换能否使两个字符串相等](../../problemset/check-if-one-string-swap-can-make-strings-equal/README.md)

problemset/check-if-number-is-a-sum-of-powers-of-three/README.md

@@ -0,0 +1,54 @@
+# 判断一个数字是否可以表示成三的幂的和
+
+> 难度：中等
+>
+> https://leetcode.cn/problems/check-if-number-is-a-sum-of-powers-of-three/
+
+## 题目
+
+给你一个整数 `n` ，如果你可以将 `n` 表示成若干个不同的三的幂之和，请你返回 `true` ，否则请返回 `false` 。
+
+对于一个整数 `y` ，如果存在整数 `x` 满足 `y == 3^x` ，我们称这个整数 `y` 是三的幂。
+
+### 示例
+
+#### 示例 1：
+
+```
+输入：n = 12
+输出：true
+解释：12 = 3^1 + 3^2
+```
+
+#### 示例 2：
+
+```
+输入：n = 91
+输出：true
+解释：91 = 3^0 + 3^2 + 3^4
+```
+
+#### 示例 3：
+
+```
+输入：n = 21
+输出：false
+```
+
+## 解题
+
+```ts 
+/**
+ * 进制
+ * @desc 时间复杂度 O(logN)  空间复杂度 O(1)
+ * @param n
+ * @returns
+ */
+export function checkPowersOfThree(n: number): boolean {
+  while (n !== 0) {
+    if (n % 3 === 2) return false
+    n = (n / 3) >> 0
+  }
+  return true
+}
+```

problemset/check-if-number-is-a-sum-of-powers-of-three/index.spec.ts

@@ -0,0 +1,16 @@
+import { describe, expect, it } from 'vitest'
+import { checkPowersOfThree } from '.'
+
+describe('判断一个数字是否可以表示成三的幂的和', () => {
+  testCase(checkPowersOfThree)
+})
+
+function testCase(fn: (n: number) => boolean) {
+  it.each([
+    [12, true],
+    [91, true],
+    [21, false],
+  ])('示例%#', (n, expected) => {
+    expect(fn(n)).toBe(expected)
+  })
+}

problemset/check-if-number-is-a-sum-of-powers-of-three/index.ts

@@ -0,0 +1,13 @@
+/**
+ * 进制
+ * @desc 时间复杂度 O(logN)  空间复杂度 O(1)
+ * @param n
+ * @returns
+ */
+export function checkPowersOfThree(n: number): boolean {
+  while (n !== 0) {
+    if (n % 3 === 2) return false
+    n = (n / 3) >> 0
+  }
+  return true
+}