From 5f25a34e75e11513243c1046a5b20fcc24eb9e71 Mon Sep 17 00:00:00 2001 From: zhangsan <646228430@qq.com> Date: Sat, 8 Mar 2025 10:33:08 +0800 Subject: [PATCH] first commit 3.8 --- .gitignore | 36 +++++++++++++++++++ pom.xml | 23 ++++++++++++ src/main/java/edu/whut/hash/TwoSum.java | 15 ++++++++ .../edu/whut/hash/HashAlgorithmsTest.java | 16 +++++++++ 4 files changed, 90 insertions(+) create mode 100644 .gitignore create mode 100644 pom.xml create mode 100644 src/main/java/edu/whut/hash/TwoSum.java create mode 100644 src/test/java/edu/whut/hash/HashAlgorithmsTest.java diff --git a/.gitignore b/.gitignore new file mode 100644 index 0000000..d0385bf --- /dev/null +++ b/.gitignore @@ -0,0 +1,36 @@ +# 忽略 IDE 相关文件 +.idea/ +*.iml +*.ipr +*.iws + +# 忽略 Maven 构建输出 +target/ +**/target/ +**/*.class +**/*.jar +**/*.war +**/*.ear + +# 忽略 Gradle 构建输出 +.gradle/ +build/ +out/ + +# 忽略日志文件 +*.log +logs/ + +# 忽略系统文件 +.DS_Store +Thumbs.db + +# 忽略本地配置文件(如数据库配置) +*.properties +*.yml +*.yaml + +# 忽略其他临时文件 +*.tmp +*.bak +*.swp \ No newline at end of file diff --git a/pom.xml b/pom.xml new file mode 100644 index 0000000..3aa353a --- /dev/null +++ b/pom.xml @@ -0,0 +1,23 @@ + + + 4.0.0 + + edu.whut + LeetCodeSolutions + 1.0-SNAPSHOT + + + 17 + 17 + + + + junit + junit + 4.12 + test + + + \ No newline at end of file diff --git a/src/main/java/edu/whut/hash/TwoSum.java b/src/main/java/edu/whut/hash/TwoSum.java new file mode 100644 index 0000000..1e787c6 --- /dev/null +++ b/src/main/java/edu/whut/hash/TwoSum.java @@ -0,0 +1,15 @@ +package edu.whut.hash; + + +/** + * 题目:两数之和 (Two Sum) + * 描述:给定一个整数数组 nums 和一个目标值 target,请你在该数组中找出和为目标值的那两个整数,并返回它们的数组下标。 + * 链接:https://leetcode.cn/problems/two-sum/ + */ + +public class TwoSum { + public int[] twoSum(int[] nums, int target) { + // 实现代码 + return new int[]{0, 1}; + } +} \ No newline at end of file diff --git a/src/test/java/edu/whut/hash/HashAlgorithmsTest.java b/src/test/java/edu/whut/hash/HashAlgorithmsTest.java new file mode 100644 index 0000000..707ac17 --- /dev/null +++ b/src/test/java/edu/whut/hash/HashAlgorithmsTest.java @@ -0,0 +1,16 @@ +package edu.whut.hash; + +import org.junit.Test; + +public class HashAlgorithmsTest { + @Test + public void testTwoSum() { + TwoSum solution = new TwoSum(); + int[] nums = {2, 7, 11, 15}; + int target = 9; + int[] result = solution.twoSum(nums, target); + for (int i = 0; i < result.length; i++) { + System.out.println(result[i]); + } + } +}