From 7f9f33597f81d4d16d97d785a638c2d5a1dfe5b3 Mon Sep 17 00:00:00 2001
From: guanlonglong <1336463467@qq.com>
Date: Tue, 20 Oct 2020 09:04:29 +0800
Subject: [PATCH 1/2] =?UTF-8?q?leetCode0001=E6=B5=8B=E8=AF=95=E4=B8=8A?=
=?UTF-8?q?=E4=BC=A0?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit
---
.idea/inspectionProfiles/Project_Default.xml | 36 ++++++++++++++++++++
src/Main.java | 6 ----
src/easy/leetCode0001.java | 21 ++++++++++++
3 files changed, 57 insertions(+), 6 deletions(-)
create mode 100644 .idea/inspectionProfiles/Project_Default.xml
delete mode 100644 src/Main.java
create mode 100644 src/easy/leetCode0001.java
diff --git a/.idea/inspectionProfiles/Project_Default.xml b/.idea/inspectionProfiles/Project_Default.xml
new file mode 100644
index 0000000..39a73c6
--- /dev/null
+++ b/.idea/inspectionProfiles/Project_Default.xml
@@ -0,0 +1,36 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/src/Main.java b/src/Main.java
deleted file mode 100644
index a0428da..0000000
--- a/src/Main.java
+++ /dev/null
@@ -1,6 +0,0 @@
-public class Main {
-
- public static void main(String[] args) {
- System.out.println("Hello World!");
- }
-}
diff --git a/src/easy/leetCode0001.java b/src/easy/leetCode0001.java
new file mode 100644
index 0000000..9ee932e
--- /dev/null
+++ b/src/easy/leetCode0001.java
@@ -0,0 +1,21 @@
+package easy;
+
+/**
+ * 1. 两数之和
+ * 给定一个整数数组 nums 和一个目标值 target，请你在该数组中找出和为目标值的那 两个 整数，并返回他们的数组下标。
+ * 你可以假设每种输入只会对应一个答案。但是，数组中同一个元素不能使用两遍。
+ * 示例:
+ * 给定 nums = [2, 7, 11, 15], target = 9
+ * 因为 nums[0] + nums[1] = 2 + 7 = 9
+ * 所以返回 [0, 1]
+ */
+
+/**
+ * @ClassName leetCode0001
+ * @Description TODO：完成算法
+ * @Author Long
+ * @Date 2020/10/20 8:46
+ * @Version 1.0
+ */
+public class leetCode0001 {
+}
--
Gitee
From cead76c14d4a41e2dea9db7c2e6030028fb3dd28 Mon Sep 17 00:00:00 2001
From: Long <1336463467@qq.com>
Date: Thu, 22 Oct 2020 20:34:27 +0800
Subject: [PATCH 2/2] =?UTF-8?q?1.=20=E4=B8=A4=E6=95=B0=E4=B9=8B=E5=92=8C?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit
---
.idea/inspectionProfiles/Project_Default.xml | 2 +-
.../{leetCode0001.java => LeetCode0001.java} | 36 ++++++++++++++++---
2 files changed, 33 insertions(+), 5 deletions(-)
rename src/easy/{leetCode0001.java => LeetCode0001.java} (40%)
diff --git a/.idea/inspectionProfiles/Project_Default.xml b/.idea/inspectionProfiles/Project_Default.xml
index 39a73c6..69a4ff5 100644
--- a/.idea/inspectionProfiles/Project_Default.xml
+++ b/.idea/inspectionProfiles/Project_Default.xml
@@ -30,7 +30,7 @@
-
+
\ No newline at end of file
diff --git a/src/easy/leetCode0001.java b/src/easy/LeetCode0001.java
similarity index 40%
rename from src/easy/leetCode0001.java
rename to src/easy/LeetCode0001.java
index 9ee932e..8aa323a 100644
--- a/src/easy/leetCode0001.java
+++ b/src/easy/LeetCode0001.java
@@ -1,5 +1,8 @@
package easy;
+import java.util.HashMap;
+import java.util.Map;
+
/**
* 1. 两数之和
* 给定一个整数数组 nums 和一个目标值 target，请你在该数组中找出和为目标值的那 两个 整数，并返回他们的数组下标。
@@ -8,14 +11,39 @@ package easy;
* 给定 nums = [2, 7, 11, 15], target = 9
* 因为 nums[0] + nums[1] = 2 + 7 = 9
* 所以返回 [0, 1]
- */
-
-/**
+ *
* @ClassName leetCode0001
* @Description TODO：完成算法
* @Author Long
* @Date 2020/10/20 8:46
* @Version 1.0
*/
-public class leetCode0001 {
+public class LeetCode0001 {
+
+ public static void main(String[] args) {
+ int[] nums = {2, 7, 11, 15};
+ int target = 9;
+ int[] result = new LeetCode0001().useMap(nums,target);
+ for (int num:result) {
+ System.out.print(num + "\t");
+ }
+ }
+
+ /**
+ * 使用Map实现
+ * @param nums 传入数组
+ * @param target 检查值
+ * @return 返回
+ */
+ private int[] useMap(int[] nums, int target) {
+ Map map = new HashMap<>();
+
+ for (int i = 0; i < nums.length; ++i) {
+ if(map.containsKey(target - nums[i])) {
+ return new int[] {map.get(target - nums[i]), i};
+ }
+ map.put(nums[i], i);
+ }
+ return new int[0];
+ }
}
--
Gitee