From be1b038fd39578ada14be4023ff806bb17c9fe5b Mon Sep 17 00:00:00 2001
From: = <--gbloal>
Date: Mon, 6 May 2024 15:10:33 +0800
Subject: [PATCH] =?UTF-8?q?feat:=20=E6=B7=BB=E5=8A=A0leetcode=E9=A2=98?=
 =?UTF-8?q?=E7=9B=AE=E4=B8=A4=E6=95=B0=E4=B9=8B=E5=92=8C(1)?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 leetcode/简单/两数之和(leetcode1).js | 45 ++++++++++++++++++++++++++++
 1 file changed, 45 insertions(+)
 create mode 100644 leetcode/简单/两数之和(leetcode1).js

diff --git a/leetcode/简单/两数之和(leetcode1).js b/leetcode/简单/两数之和(leetcode1).js
new file mode 100644
index 0000000..8b74889
--- /dev/null
+++ b/leetcode/简单/两数之和(leetcode1).js
@@ -0,0 +1,45 @@
+/*
+给定一个整数数组 nums 和一个整数目标值 target，请你在该数组中找出 和为目标值 target  的那 两个 整数，并返回它们的数组下标。
+
+你可以假设每种输入只会对应一个答案。但是，数组中同一个元素在答案里不能重复出现。
+
+你可以按任意顺序返回答案。
+
+*/
+
+/*
+
+*/
+
+/**
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {number[]}
+ */
+const twoSum = function (nums, target) {
+  const n = nums.length;
+  for (let i = 0; i < n; i++) {
+    for (let j = 0; j < n; j++) {
+      if (j === i) continue;
+      if (nums[i] + nums[j] === target) return [i, j];
+    }
+  }
+  return -1;
+};
+
+const twoSum2 = function (nums, target) {
+  const n = nums.length;
+  const map = new Map();
+  for (let i = 0; i < n; i++) {
+    if (map.has(nums[i])) {
+      return [map.get(nums[i]), i];
+    }
+    map.set(target - nums[i], i);
+  }
+  return -1;
+};
+
+const nums = [2, 7, 11, 15];
+const target = 9;
+console.log(twoSum(nums, target));
+console.log(twoSum2(nums, target));