chore: update 3289. The Two Sneaky Numbers of Digitville

Author: JuneLin2001

docs/LeetCode/3289. The Two Sneaky Numbers of Digitville/README.mdx

@@ -0,0 +1,69 @@
+---
+title: 3289. The Two Sneaky Numbers of Digitville
+description: In the town of Digitville, there was a list of numbers called nums containing integers from 0 to n - 1. Each number was supposed to appear exactly once in the list, however, two mischievous numbers sneaked in an additional time, making the list longer than usual. As the town detective, your task is to find these two sneaky numbers. Return an array of size two containing the two numbers (in any order), so peace can return to Digitville.
+keywords:
+  [
+    LeetCode,
+    3289. The Two Sneaky Numbers of Digitville,
+    Easy,
+    Array,
+    Hash Table,
+    Math,
+  ]
+tags: [LeetCode, Easy, Array, Hash Table, Math]
+---
+
+# [{frontMatter.title}](https://leetcode.com/problems/special-array-i)
+
+import Tabs from "@theme/Tabs";
+import TabItem from "@theme/TabItem";
+import CodeBlock from "@theme/CodeBlock";
+import DifficultyBadge from "@site/src/components/Badges/DifficultyBadge";
+import Solution from "!!raw-loader!./solution.js";
+import Description from "./_Description.md";
+import Examples from "./_Examples.md";
+
+<DifficultyBadge difficulty="Easy" />
+
+<Tabs>
+  <TabItem value="description" label="題目描述" default>
+    <details open>
+      <summary>Description</summary>
+        <Description />
+        <Examples />
+    </details> 
+  </TabItem>
+
+  <TabItem value="solution" label="解答">
+   ## Solution
+    <CodeBlock language="js">{Solution}</CodeBlock>
+  </TabItem>
+</Tabs>
+
+## 解題思路
+
+想法是使用 counter 來記錄數字出現的數量
+
+```js
+for (let i = 0; i < nums.length; i++) {
+  if (counter[nums[i]]) {
+    counter[nums[i]]++;
+  } else {
+    counter[nums[i]] = 1;
+  }
+}
+```
+
+遍歷一遍陣列後再次遍歷 `counter`，若出現兩次則記錄起來，最後回傳答案。
+
+```js
+for (let key in counter) {
+  if (counter[key] === 2) {
+    result.push(parseInt(key));
+  }
+}
+```
+
+## 心得
+
+我的答案好像滿冗長的，不知是否可以簡化。

docs/LeetCode/3289. The Two Sneaky Numbers of Digitville/_Description.md

@@ -0,0 +1,3 @@
+In the town of Digitville, there was a list of numbers called nums containing integers from 0 to n - 1. Each number was supposed to appear exactly once in the list, however, two mischievous numbers sneaked in an additional time, making the list longer than usual.
+
+As the town detective, your task is to find these two sneaky numbers. Return an array of size two containing the two numbers (in any order), so peace can return to Digitville.

docs/LeetCode/3289. The Two Sneaky Numbers of Digitville/_Examples.md

@@ -0,0 +1,27 @@
+#### Example 1:
+
+> **Input:** nums = [0,1,1,0]  
+> **Output:** [0,1]  
+> **Explanation:**  
+> The numbers 0 and 1 each appear twice in the array.
+
+#### Example 2:
+
+> **Input:** nums = [0,3,2,1,3,2]  
+> **Output:** [2,3]  
+> **Explanation:**  
+> The numbers 2 and 3 each appear twice in the array.
+
+#### Example 3:
+
+> **Input:** nums = [7,1,5,4,3,4,6,0,9,5,8,2]  
+> **Output:** [4,5]  
+> **Explanation:**  
+> The numbers 4 and 5 each appear twice in the array.
+
+## Constraints:
+
+- `2 <= n <= 100`
+- `nums.length == n + 2`
+- `0 <= nums[i] < n`
+- The input is generated such that `nums` contains **exactly** two repeated elements.

docs/LeetCode/3289. The Two Sneaky Numbers of Digitville/solution.js

@@ -0,0 +1,24 @@
+/**
+ * @param {number[]} nums
+ * @return {number[]}
+ */
+var getSneakyNumbers = function (nums) {
+  const counter = {};
+  const result = [];
+
+  for (let i = 0; i < nums.length; i++) {
+    if (counter[nums[i]]) {
+      counter[nums[i]]++;
+    } else {
+      counter[nums[i]] = 1;
+    }
+  }
+
+  for (let key in counter) {
+    if (counter[key] === 2) {
+      result.push(parseInt(key));
+    }
+  }
+
+  return result;
+};