diff --git a/solution/0200-0299/0260.Single Number III/README.md b/solution/0200-0299/0260.Single Number III/README.md index c3a3cff649bd9..10d0586929901 100644 --- a/solution/0200-0299/0260.Single Number III/README.md +++ b/solution/0200-0299/0260.Single Number III/README.md @@ -238,4 +238,48 @@ public class Solution { + + +### 方法二:哈希表 + + + +#### TypeScript + +```ts +function singleNumber(nums: number[]): number[] { + const set = new Set(); + + for (const x of nums) { + if (set.has(x)) set.delete(x); + else set.add(x); + } + + return [...set]; +} +``` + +#### JavaScript + +```js +/** + * @param {number[]} nums + * @return {number[]} + */ +function singleNumber(nums) { + const set = new Set(); + + for (const x of nums) { + if (set.has(x)) set.delete(x); + else set.add(x); + } + + return [...set]; +} +``` + + + + + diff --git a/solution/0200-0299/0260.Single Number III/README_EN.md b/solution/0200-0299/0260.Single Number III/README_EN.md index a5208fc56eca8..89e787d9e26c0 100644 --- a/solution/0200-0299/0260.Single Number III/README_EN.md +++ b/solution/0200-0299/0260.Single Number III/README_EN.md @@ -236,4 +236,48 @@ public class Solution { + + +### Solution 2: Hash Table + + + +#### TypeScript + +```ts +function singleNumber(nums: number[]): number[] { + const set = new Set(); + + for (const x of nums) { + if (set.has(x)) set.delete(x); + else set.add(x); + } + + return [...set]; +} +``` + +#### JavaScript + +```js +/** + * @param {number[]} nums + * @return {number[]} + */ +function singleNumber(nums) { + const set = new Set(); + + for (const x of nums) { + if (set.has(x)) set.delete(x); + else set.add(x); + } + + return [...set]; +} +``` + + + + + diff --git a/solution/0200-0299/0260.Single Number III/Solution2.js b/solution/0200-0299/0260.Single Number III/Solution2.js new file mode 100644 index 0000000000000..a7207c2194bdd --- /dev/null +++ b/solution/0200-0299/0260.Single Number III/Solution2.js @@ -0,0 +1,14 @@ +/** + * @param {number[]} nums + * @return {number[]} + */ +function singleNumber(nums) { + const set = new Set(); + + for (const x of nums) { + if (set.has(x)) set.delete(x); + else set.add(x); + } + + return [...set]; +} diff --git a/solution/0200-0299/0260.Single Number III/Solution2.ts b/solution/0200-0299/0260.Single Number III/Solution2.ts new file mode 100644 index 0000000000000..6851e0822813f --- /dev/null +++ b/solution/0200-0299/0260.Single Number III/Solution2.ts @@ -0,0 +1,10 @@ +function singleNumber(nums: number[]): number[] { + const set = new Set(); + + for (const x of nums) { + if (set.has(x)) set.delete(x); + else set.add(x); + } + + return [...set]; +}