From 6a9a7056924b2eb834b7ae08eb8be2e94e670689 Mon Sep 17 00:00:00 2001 From: zeekling Date: Sun, 15 Nov 2020 14:26:19 +0800 Subject: [PATCH] =?UTF-8?q?=E5=B0=86=E9=A1=B9=E7=9B=AE=E4=BF=AE=E6=94=B9?= =?UTF-8?q?=E4=B8=BAmaven=E9=A1=B9=E7=9B=AE?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .classpath | 23 ++++++++++++++++ .gitignore | 1 + .project | 23 ++++++++++++++++ .settings/org.eclipse.core.resources.prefs | 4 +++ .settings/org.eclipse.jdt.core.prefs | 15 +++++++++++ .settings/org.eclipse.m2e.core.prefs | 4 +++ pom.xml | 27 +++++++++++++++++++ .../java/com/leetcode/array}/ThreeSum.java | 2 +- .../java/com/leetcode}/jiuzhang/PlusAB.java | 2 +- .../leetcode}/list/FindNumberIn2DArray.java | 2 +- .../java/com/leetcode}/list/MiddleNode.java | 2 +- .../java/com/leetcode}/list/PivotIndex.java | 2 +- .../java/com/leetcode}/list/SearchInsert.java | 2 +- .../java/com/leetcode}/num/SumNums.java | 2 +- .../com/leetcode}/simple/BalancedTree.java | 2 +- .../com/leetcode}/simple/CompareStrings.java | 2 +- .../leetcode}/simple/MergeSortedArray.java | 2 +- .../leetcode}/simple/MergeSortedArrayInA.java | 2 +- .../java/com/leetcode}/simple/MinPathSum.java | 2 +- .../simple/ProductExcludeItself.java | 2 +- .../simple/RecoverRotatedSortedArray.java | 2 +- .../leetcode}/simple/RemoveDuplicates.java | 2 +- .../leetcode}/simple/ReverseLinkedList.java | 2 +- .../leetcode}/simple/ReverseWordsByBlank.java | 2 +- .../com/leetcode}/simple/RotateString.java | 2 +- .../leetcode}/simple/SearchSortedMatrix.java | 2 +- .../leetcode}/simple/SubStringLocation.java | 2 +- .../java/com/leetcode}/simple/ZerosOfN.java | 2 +- .../leetcode}/string/FindRepeatNumber.java | 2 +- .../string/LengthOfLongestSubString.java | 2 +- 30 files changed, 120 insertions(+), 23 deletions(-) create mode 100644 .classpath create mode 100644 .project create mode 100644 .settings/org.eclipse.core.resources.prefs create mode 100644 .settings/org.eclipse.jdt.core.prefs create mode 100644 .settings/org.eclipse.m2e.core.prefs create mode 100644 pom.xml rename src/{leetCode => main/java/com/leetcode/array}/ThreeSum.java (98%) rename src/{ => main/java/com/leetcode}/jiuzhang/PlusAB.java (92%) rename src/{ => main/java/com/leetcode}/list/FindNumberIn2DArray.java (97%) rename src/{ => main/java/com/leetcode}/list/MiddleNode.java (95%) rename src/{ => main/java/com/leetcode}/list/PivotIndex.java (96%) rename src/{ => main/java/com/leetcode}/list/SearchInsert.java (96%) rename src/{ => main/java/com/leetcode}/num/SumNums.java (94%) rename src/{ => main/java/com/leetcode}/simple/BalancedTree.java (97%) rename src/{ => main/java/com/leetcode}/simple/CompareStrings.java (97%) rename src/{ => main/java/com/leetcode}/simple/MergeSortedArray.java (97%) rename src/{ => main/java/com/leetcode}/simple/MergeSortedArrayInA.java (97%) rename src/{ => main/java/com/leetcode}/simple/MinPathSum.java (96%) rename src/{ => main/java/com/leetcode}/simple/ProductExcludeItself.java (96%) rename src/{ => main/java/com/leetcode}/simple/RecoverRotatedSortedArray.java (96%) rename src/{ => main/java/com/leetcode}/simple/RemoveDuplicates.java (96%) rename src/{ => main/java/com/leetcode}/simple/ReverseLinkedList.java (94%) rename src/{ => main/java/com/leetcode}/simple/ReverseWordsByBlank.java (97%) rename src/{ => main/java/com/leetcode}/simple/RotateString.java (95%) rename src/{ => main/java/com/leetcode}/simple/SearchSortedMatrix.java (97%) rename src/{ => main/java/com/leetcode}/simple/SubStringLocation.java (96%) rename src/{ => main/java/com/leetcode}/simple/ZerosOfN.java (93%) rename src/{ => main/java/com/leetcode}/string/FindRepeatNumber.java (96%) rename src/{ => main/java/com/leetcode}/string/LengthOfLongestSubString.java (96%) diff --git a/.classpath b/.classpath new file mode 100644 index 0000000..fd1d061 --- /dev/null +++ b/.classpath @@ -0,0 +1,23 @@ + + + + + + + + + + + + + + + + + + + + + + + diff --git a/.gitignore b/.gitignore index 5ba13b5..eb564f6 100644 --- a/.gitignore +++ b/.gitignore @@ -1,3 +1,4 @@ target .idea *.swp +*.class diff --git a/.project b/.project new file mode 100644 index 0000000..d8834ad --- /dev/null +++ b/.project @@ -0,0 +1,23 @@ + + + leetcode + + + + + + org.eclipse.jdt.core.javabuilder + + + + + org.eclipse.m2e.core.maven2Builder + + + + + + org.eclipse.jdt.core.javanature + org.eclipse.m2e.core.maven2Nature + + diff --git a/.settings/org.eclipse.core.resources.prefs b/.settings/org.eclipse.core.resources.prefs new file mode 100644 index 0000000..f9fe345 --- /dev/null +++ b/.settings/org.eclipse.core.resources.prefs @@ -0,0 +1,4 @@ +eclipse.preferences.version=1 +encoding//src/main/java=UTF-8 +encoding//src/test/java=UTF-8 +encoding/=UTF-8 diff --git a/.settings/org.eclipse.jdt.core.prefs b/.settings/org.eclipse.jdt.core.prefs new file mode 100644 index 0000000..db24ee7 --- /dev/null +++ b/.settings/org.eclipse.jdt.core.prefs @@ -0,0 +1,15 @@ +eclipse.preferences.version=1 +org.eclipse.jdt.core.compiler.codegen.inlineJsrBytecode=enabled +org.eclipse.jdt.core.compiler.codegen.targetPlatform=1.8 +org.eclipse.jdt.core.compiler.codegen.unusedLocal=preserve +org.eclipse.jdt.core.compiler.compliance=1.8 +org.eclipse.jdt.core.compiler.debug.lineNumber=generate +org.eclipse.jdt.core.compiler.debug.localVariable=generate +org.eclipse.jdt.core.compiler.debug.sourceFile=generate +org.eclipse.jdt.core.compiler.problem.assertIdentifier=error +org.eclipse.jdt.core.compiler.problem.enablePreviewFeatures=disabled +org.eclipse.jdt.core.compiler.problem.enumIdentifier=error +org.eclipse.jdt.core.compiler.problem.forbiddenReference=warning +org.eclipse.jdt.core.compiler.problem.reportPreviewFeatures=ignore +org.eclipse.jdt.core.compiler.release=disabled +org.eclipse.jdt.core.compiler.source=1.8 diff --git a/.settings/org.eclipse.m2e.core.prefs b/.settings/org.eclipse.m2e.core.prefs new file mode 100644 index 0000000..f897a7f --- /dev/null +++ b/.settings/org.eclipse.m2e.core.prefs @@ -0,0 +1,4 @@ +activeProfiles= +eclipse.preferences.version=1 +resolveWorkspaceProjects=true +version=1 diff --git a/pom.xml b/pom.xml new file mode 100644 index 0000000..66b6b5d --- /dev/null +++ b/pom.xml @@ -0,0 +1,27 @@ + + 4.0.0 + + com.algorithm + leetcode + 0.0.1-SNAPSHOT + jar + + leetcode + http://maven.apache.org + + + UTF-8 + 1.8 + 1.8 + + + + + junit + junit + 4.13 + test + + + diff --git a/src/leetCode/ThreeSum.java b/src/main/java/com/leetcode/array/ThreeSum.java similarity index 98% rename from src/leetCode/ThreeSum.java rename to src/main/java/com/leetcode/array/ThreeSum.java index 4fb3b9f..714b272 100644 --- a/src/leetCode/ThreeSum.java +++ b/src/main/java/com/leetcode/array/ThreeSum.java @@ -1,4 +1,4 @@ -package leetCode; +package com.leetcode.array; import java.util.ArrayList; import java.util.Arrays; diff --git a/src/jiuzhang/PlusAB.java b/src/main/java/com/leetcode/jiuzhang/PlusAB.java similarity index 92% rename from src/jiuzhang/PlusAB.java rename to src/main/java/com/leetcode/jiuzhang/PlusAB.java index 3973b70..c7d008b 100644 --- a/src/jiuzhang/PlusAB.java +++ b/src/main/java/com/leetcode/jiuzhang/PlusAB.java @@ -1,4 +1,4 @@ -package jiuzhang; +package com.leetcode.jiuzhang; /** * @apiNote 给出两个整数 aaa 和 bbb , 求他们的和。 diff --git a/src/list/FindNumberIn2DArray.java b/src/main/java/com/leetcode/list/FindNumberIn2DArray.java similarity index 97% rename from src/list/FindNumberIn2DArray.java rename to src/main/java/com/leetcode/list/FindNumberIn2DArray.java index bbc4770..f2a1676 100644 --- a/src/list/FindNumberIn2DArray.java +++ b/src/main/java/com/leetcode/list/FindNumberIn2DArray.java @@ -1,4 +1,4 @@ -package list; +package com.leetcode.list; /** * @apiNote 在一个 n * m 的二维数组中，每一行都按照从左到右递增的顺序排序，每一列都按照从上到下递增的顺序排序。 diff --git a/src/list/MiddleNode.java b/src/main/java/com/leetcode/list/MiddleNode.java similarity index 95% rename from src/list/MiddleNode.java rename to src/main/java/com/leetcode/list/MiddleNode.java index f6de8c2..dfd0c72 100644 --- a/src/list/MiddleNode.java +++ b/src/main/java/com/leetcode/list/MiddleNode.java @@ -1,4 +1,4 @@ -package list; +package com.leetcode.list; class ListNode { int val; diff --git a/src/list/PivotIndex.java b/src/main/java/com/leetcode/list/PivotIndex.java similarity index 96% rename from src/list/PivotIndex.java rename to src/main/java/com/leetcode/list/PivotIndex.java index f8e0c2e..d60056b 100644 --- a/src/list/PivotIndex.java +++ b/src/main/java/com/leetcode/list/PivotIndex.java @@ -1,4 +1,4 @@ -package list; +package com.leetcode.list; /** diff --git a/src/list/SearchInsert.java b/src/main/java/com/leetcode/list/SearchInsert.java similarity index 96% rename from src/list/SearchInsert.java rename to src/main/java/com/leetcode/list/SearchInsert.java index 0194f39..6578957 100644 --- a/src/list/SearchInsert.java +++ b/src/main/java/com/leetcode/list/SearchInsert.java @@ -1,4 +1,4 @@ -package list; +package com.leetcode.list; /** * @file SearchInsert.java diff --git a/src/num/SumNums.java b/src/main/java/com/leetcode/num/SumNums.java similarity index 94% rename from src/num/SumNums.java rename to src/main/java/com/leetcode/num/SumNums.java index 477fa59..62ad680 100644 --- a/src/num/SumNums.java +++ b/src/main/java/com/leetcode/num/SumNums.java @@ -1,4 +1,4 @@ -package num; +package com.leetcode.num; /** * @file SumNums.java diff --git a/src/simple/BalancedTree.java b/src/main/java/com/leetcode/simple/BalancedTree.java similarity index 97% rename from src/simple/BalancedTree.java rename to src/main/java/com/leetcode/simple/BalancedTree.java index 0f36fc7..5751427 100644 --- a/src/simple/BalancedTree.java +++ b/src/main/java/com/leetcode/simple/BalancedTree.java @@ -1,4 +1,4 @@ -package simple; +package com.leetcode.simple; /** * @apiNote 给定一个二叉树,确定它是高度平衡的。对于这个问题,一棵高度平衡的二叉树的定义是：一棵二叉树中每个节点的两个子树的深度相差不会超过1。 diff --git a/src/simple/CompareStrings.java b/src/main/java/com/leetcode/simple/CompareStrings.java similarity index 97% rename from src/simple/CompareStrings.java rename to src/main/java/com/leetcode/simple/CompareStrings.java index 3b25ffc..8c9ac3c 100644 --- a/src/simple/CompareStrings.java +++ b/src/main/java/com/leetcode/simple/CompareStrings.java @@ -1,4 +1,4 @@ -package simple; +package com.leetcode.simple; /** * @apiNote 比较两个字符串A和B，确定A中是否包含B中所有的字符。字符串A和B中的字符都是 大写字母 diff --git a/src/simple/MergeSortedArray.java b/src/main/java/com/leetcode/simple/MergeSortedArray.java similarity index 97% rename from src/simple/MergeSortedArray.java rename to src/main/java/com/leetcode/simple/MergeSortedArray.java index 4244759..afb6c3b 100644 --- a/src/simple/MergeSortedArray.java +++ b/src/main/java/com/leetcode/simple/MergeSortedArray.java @@ -1,4 +1,4 @@ -package simple; +package com.leetcode.simple; /** * @apiNote 合并两个有序升序的整数数组A和B变成一个新的数组。新数组也要有序。 diff --git a/src/simple/MergeSortedArrayInA.java b/src/main/java/com/leetcode/simple/MergeSortedArrayInA.java similarity index 97% rename from src/simple/MergeSortedArrayInA.java rename to src/main/java/com/leetcode/simple/MergeSortedArrayInA.java index ab9f24a..24067ff 100644 --- a/src/simple/MergeSortedArrayInA.java +++ b/src/main/java/com/leetcode/simple/MergeSortedArrayInA.java @@ -1,4 +1,4 @@ -package simple; +package com.leetcode.simple; /** * @apiNote 合并两个排序的整数数组A和B变成一个新的数组。 diff --git a/src/simple/MinPathSum.java b/src/main/java/com/leetcode/simple/MinPathSum.java similarity index 96% rename from src/simple/MinPathSum.java rename to src/main/java/com/leetcode/simple/MinPathSum.java index 63eb24d..dfaea9d 100644 --- a/src/simple/MinPathSum.java +++ b/src/main/java/com/leetcode/simple/MinPathSum.java @@ -1,4 +1,4 @@ -package simple; +package com.leetcode.simple; /** * @apiNote 给定一个只含非负整数的m*n网格，找到一条从左上角到右下角的可以使数字和最小的路径。 diff --git a/src/simple/ProductExcludeItself.java b/src/main/java/com/leetcode/simple/ProductExcludeItself.java similarity index 96% rename from src/simple/ProductExcludeItself.java rename to src/main/java/com/leetcode/simple/ProductExcludeItself.java index c2da520..20ae31a 100644 --- a/src/simple/ProductExcludeItself.java +++ b/src/main/java/com/leetcode/simple/ProductExcludeItself.java @@ -1,4 +1,4 @@ -package simple; +package com.leetcode.simple; import java.util.ArrayList; import java.util.List; diff --git a/src/simple/RecoverRotatedSortedArray.java b/src/main/java/com/leetcode/simple/RecoverRotatedSortedArray.java similarity index 96% rename from src/simple/RecoverRotatedSortedArray.java rename to src/main/java/com/leetcode/simple/RecoverRotatedSortedArray.java index a2d1cf2..7cf0467 100644 --- a/src/simple/RecoverRotatedSortedArray.java +++ b/src/main/java/com/leetcode/simple/RecoverRotatedSortedArray.java @@ -1,4 +1,4 @@ -package simple; +package com.leetcode.simple; import java.util.List; diff --git a/src/simple/RemoveDuplicates.java b/src/main/java/com/leetcode/simple/RemoveDuplicates.java similarity index 96% rename from src/simple/RemoveDuplicates.java rename to src/main/java/com/leetcode/simple/RemoveDuplicates.java index 26d04fc..aa99de5 100644 --- a/src/simple/RemoveDuplicates.java +++ b/src/main/java/com/leetcode/simple/RemoveDuplicates.java @@ -1,4 +1,4 @@ -package simple; +package com.leetcode.simple; /** * @apiNote 给定一个排序数组，在原数组中“删除”重复出现的数字，使得每个元素只出现一次，并且返回“新”数组的长度。 diff --git a/src/simple/ReverseLinkedList.java b/src/main/java/com/leetcode/simple/ReverseLinkedList.java similarity index 94% rename from src/simple/ReverseLinkedList.java rename to src/main/java/com/leetcode/simple/ReverseLinkedList.java index c1c7392..05ec4c9 100644 --- a/src/simple/ReverseLinkedList.java +++ b/src/main/java/com/leetcode/simple/ReverseLinkedList.java @@ -1,4 +1,4 @@ -package simple; +package com.leetcode.simple; /** * @apiNote 翻转一个链表 diff --git a/src/simple/ReverseWordsByBlank.java b/src/main/java/com/leetcode/simple/ReverseWordsByBlank.java similarity index 97% rename from src/simple/ReverseWordsByBlank.java rename to src/main/java/com/leetcode/simple/ReverseWordsByBlank.java index 4c9affe..4b3de46 100644 --- a/src/simple/ReverseWordsByBlank.java +++ b/src/main/java/com/leetcode/simple/ReverseWordsByBlank.java @@ -1,4 +1,4 @@ -package simple; +package com.leetcode.simple; /** * @apiNote 给定一个字符串，逐个翻转字符串中的每个单词。 diff --git a/src/simple/RotateString.java b/src/main/java/com/leetcode/simple/RotateString.java similarity index 95% rename from src/simple/RotateString.java rename to src/main/java/com/leetcode/simple/RotateString.java index 12adb81..f3e60f2 100644 --- a/src/simple/RotateString.java +++ b/src/main/java/com/leetcode/simple/RotateString.java @@ -1,4 +1,4 @@ -package simple; +package com.leetcode.simple; public class RotateString { public char[] rotateString(char[] A, int offset) { diff --git a/src/simple/SearchSortedMatrix.java b/src/main/java/com/leetcode/simple/SearchSortedMatrix.java similarity index 97% rename from src/simple/SearchSortedMatrix.java rename to src/main/java/com/leetcode/simple/SearchSortedMatrix.java index 139e16f..ddd755c 100644 --- a/src/simple/SearchSortedMatrix.java +++ b/src/main/java/com/leetcode/simple/SearchSortedMatrix.java @@ -1,4 +1,4 @@ -package simple; +package com.leetcode.simple; /** * @apiNote 写出一个高效的算法来搜索 m × n矩阵中的值。这个矩阵具有以下特性： diff --git a/src/simple/SubStringLocation.java b/src/main/java/com/leetcode/simple/SubStringLocation.java similarity index 96% rename from src/simple/SubStringLocation.java rename to src/main/java/com/leetcode/simple/SubStringLocation.java index 1d906a5..ee3f6a0 100644 --- a/src/simple/SubStringLocation.java +++ b/src/main/java/com/leetcode/simple/SubStringLocation.java @@ -1,4 +1,4 @@ -package simple; +package com.leetcode.simple; /** * @apiNote 对于一个给定的 source 字符串和一个 target 字符串，你应该在 source 字符串中找出 target 字符串出现的第一个位 diff --git a/src/simple/ZerosOfN.java b/src/main/java/com/leetcode/simple/ZerosOfN.java similarity index 93% rename from src/simple/ZerosOfN.java rename to src/main/java/com/leetcode/simple/ZerosOfN.java index 86a848b..2bb6b43 100644 --- a/src/simple/ZerosOfN.java +++ b/src/main/java/com/leetcode/simple/ZerosOfN.java @@ -1,4 +1,4 @@ -package simple; +package com.leetcode.simple; /** * @apiNote 设计一个算法，计算出n阶乘中尾部零的个数 diff --git a/src/string/FindRepeatNumber.java b/src/main/java/com/leetcode/string/FindRepeatNumber.java similarity index 96% rename from src/string/FindRepeatNumber.java rename to src/main/java/com/leetcode/string/FindRepeatNumber.java index d51cbad..3a84fbe 100644 --- a/src/string/FindRepeatNumber.java +++ b/src/main/java/com/leetcode/string/FindRepeatNumber.java @@ -1,4 +1,4 @@ -package string; +package com.leetcode.string; import java.util.HashSet; import java.util.Set; diff --git a/src/string/LengthOfLongestSubString.java b/src/main/java/com/leetcode/string/LengthOfLongestSubString.java similarity index 96% rename from src/string/LengthOfLongestSubString.java rename to src/main/java/com/leetcode/string/LengthOfLongestSubString.java index 79fa5ff..f45b6ee 100644 --- a/src/string/LengthOfLongestSubString.java +++ b/src/main/java/com/leetcode/string/LengthOfLongestSubString.java @@ -1,4 +1,4 @@ -package string; +package com.leetcode.string; import java.util.HashSet; import java.util.Set;