将项目修改为maven项目

.classpath

@@ -0,0 +1,23 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<classpath>
+	<classpathentry kind="src" output="target/classes" path="src/main/java">
+		<attributes>
+			<attribute name="optional" value="true"/>
+			<attribute name="maven.pomderived" value="true"/>
+		</attributes>
+	</classpathentry>
+	<classpathentry kind="src" output="target/test-classes" path="src/test/java">
+		<attributes>
+			<attribute name="optional" value="true"/>
+			<attribute name="maven.pomderived" value="true"/>
+			<attribute name="test" value="true"/>
+		</attributes>
+	</classpathentry>
+	<classpathentry kind="con" path="org.eclipse.jdt.launching.JRE_CONTAINER/org.eclipse.jdt.internal.debug.ui.launcher.StandardVMType/JavaSE-1.8"/>
+	<classpathentry kind="con" path="org.eclipse.m2e.MAVEN2_CLASSPATH_CONTAINER">
+		<attributes>
+			<attribute name="maven.pomderived" value="true"/>
+		</attributes>
+	</classpathentry>
+	<classpathentry kind="output" path="target/classes"/>
+</classpath>

.gitignore

@@ -1,3 +1,4 @@
 target
 .idea
 *.swp
+*.class

.project

@@ -0,0 +1,23 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<projectDescription>
+	<name>leetcode</name>
+	<comment></comment>
+	<projects>
+	</projects>
+	<buildSpec>
+		<buildCommand>
+			<name>org.eclipse.jdt.core.javabuilder</name>
+			<arguments>
+			</arguments>
+		</buildCommand>
+		<buildCommand>
+			<name>org.eclipse.m2e.core.maven2Builder</name>
+			<arguments>
+			</arguments>
+		</buildCommand>
+	</buildSpec>
+	<natures>
+		<nature>org.eclipse.jdt.core.javanature</nature>
+		<nature>org.eclipse.m2e.core.maven2Nature</nature>
+	</natures>
+</projectDescription>

.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/<project>=UTF-8

.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

.settings/org.eclipse.m2e.core.prefs

@@ -0,0 +1,4 @@
+activeProfiles=
+eclipse.preferences.version=1
+resolveWorkspaceProjects=true
+version=1

pom.xml

@@ -0,0 +1,27 @@
+<project xmlns="http://maven.apache.org/POM/4.0.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+  xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/xsd/maven-4.0.0.xsd">
+  <modelVersion>4.0.0</modelVersion>
+
+  <groupId>com.algorithm</groupId>
+  <artifactId>leetcode</artifactId>
+  <version>0.0.1-SNAPSHOT</version>
+  <packaging>jar</packaging>
+
+  <name>leetcode</name>
+  <url>http://maven.apache.org</url>
+
+  <properties>
+    <project.build.sourceEncoding>UTF-8</project.build.sourceEncoding>
+    <maven.compiler.source>1.8</maven.compiler.source>
+    <maven.compiler.target>1.8</maven.compiler.target>
+  </properties>
+
+  <dependencies>
+    <dependency>
+      <groupId>junit</groupId>
+      <artifactId>junit</artifactId>
+      <version>4.13</version>
+      <scope>test</scope>
+    </dependency>
+  </dependencies>
+</project>

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;

src/main/java/com/leetcode/jiuzhang/PlusAB.java

@@ -1,4 +1,4 @@
-package jiuzhang;
+package com.leetcode.jiuzhang;
 
 /**
  * @apiNote 给出两个整数 aaa 和 bbb , 求他们的和。

src/main/java/com/leetcode/list/FindNumberIn2DArray.java

@@ -1,4 +1,4 @@
-package list;
+package com.leetcode.list;
 
 /**
  * @apiNote 在一个 n * m 的二维数组中，每一行都按照从左到右递增的顺序排序，每一列都按照从上到下递增的顺序排序。

src/main/java/com/leetcode/list/MiddleNode.java

@@ -1,4 +1,4 @@
-package list;
+package com.leetcode.list;
 
 class ListNode {
 	int val;

src/main/java/com/leetcode/list/PivotIndex.java

@@ -1,4 +1,4 @@
-package list;
+package com.leetcode.list;
 
 
 /**

src/main/java/com/leetcode/list/SearchInsert.java

@@ -1,4 +1,4 @@
-package list;
+package com.leetcode.list;
 
 /**
  * @file SearchInsert.java

src/main/java/com/leetcode/num/SumNums.java

@@ -1,4 +1,4 @@
-package num;
+package com.leetcode.num;
 
 /**
  * @file SumNums.java

src/main/java/com/leetcode/simple/BalancedTree.java

@@ -1,4 +1,4 @@
-package simple;
+package com.leetcode.simple;
 
 /**
  * @apiNote 给定一个二叉树,确定它是高度平衡的。对于这个问题,一棵高度平衡的二叉树的定义是：一棵二叉树中每个节点的两个子树的深度相差不会超过1。

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中的字符都是 大写字母

src/main/java/com/leetcode/simple/MergeSortedArray.java

@@ -1,4 +1,4 @@
-package simple;
+package com.leetcode.simple;
 
 /**
  * @apiNote 合并两个有序升序的整数数组A和B变成一个新的数组。新数组也要有序。

src/main/java/com/leetcode/simple/MergeSortedArrayInA.java

@@ -1,4 +1,4 @@
-package simple;
+package com.leetcode.simple;
 
 /**
  * @apiNote 合并两个排序的整数数组A和B变成一个新的数组。

src/main/java/com/leetcode/simple/MinPathSum.java

@@ -1,4 +1,4 @@
-package simple;
+package com.leetcode.simple;
 
 /**
  * @apiNote 给定一个只含非负整数的m*n网格，找到一条从左上角到右下角的可以使数字和最小的路径。

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;

src/main/java/com/leetcode/simple/RecoverRotatedSortedArray.java

@@ -1,4 +1,4 @@
-package simple;
+package com.leetcode.simple;
 
 import java.util.List;
 

src/main/java/com/leetcode/simple/RemoveDuplicates.java

@@ -1,4 +1,4 @@
-package simple;
+package com.leetcode.simple;
 
 /**
  * @apiNote 给定一个排序数组，在原数组中“删除”重复出现的数字，使得每个元素只出现一次，并且返回“新”数组的长度。

src/main/java/com/leetcode/simple/ReverseLinkedList.java

@@ -1,4 +1,4 @@
-package simple;
+package com.leetcode.simple;
 
 /**
  * @apiNote 翻转一个链表

src/main/java/com/leetcode/simple/ReverseWordsByBlank.java

@@ -1,4 +1,4 @@
-package simple;
+package com.leetcode.simple;
 
 /**
  * @apiNote 给定一个字符串，逐个翻转字符串中的每个单词。

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) {

src/main/java/com/leetcode/simple/SearchSortedMatrix.java

@@ -1,4 +1,4 @@
-package simple;
+package com.leetcode.simple;
 
 /**
  * @apiNote 写出一个高效的算法来搜索 m × n矩阵中的值。这个矩阵具有以下特性：

src/main/java/com/leetcode/simple/SubStringLocation.java

@@ -1,4 +1,4 @@
-package simple;
+package com.leetcode.simple;
 
 /**
  * @apiNote 对于一个给定的 source 字符串和一个 target 字符串，你应该在 source 字符串中找出 target 字符串出现的第一个位

src/main/java/com/leetcode/simple/ZerosOfN.java

@@ -1,4 +1,4 @@
-package simple;
+package com.leetcode.simple;
 
 /**
  * @apiNote 设计一个算法，计算出n阶乘中尾部零的个数

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;

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;