reorder repo

zdong1995 · zdong1995 · commit 73cabe365ed4 · 2021-01-26T12:00:03.000-05:00
diff --git a/README-EN.md b/README-EN.md
@@ -1,6 +1,6 @@
 # Pattern Summary for Algorithm Problems
 
-[![](https://img.shields.io/badge/LeetCode-Solution-yellow?logo=leetcode)](https://github.com/zdong1995/LeetCode-Solution-Well-Explained) [![](https://img.shields.io/badge/Algo-Interview-blue?&logo=github)](https://github.com/zdong1995/Algorithm-Interview) ![java](https://img.shields.io/badge/Language-Java-orange?logo=java) ![Build](https://github.com/zdong1995/Algorithm-Interview/workflows/Build/badge.svg)  [![](https://img.shields.io/badge/Github-zdong1995-blue?style=social&logo=github)](https://github.com/zdong1995/)
+[![](https://img.shields.io/badge/LeetCode-Solution-yellow?logo=leetcode)](https://github.com/zdong1995/LeetCode-Solution-Well-Explained) [![](https://img.shields.io/badge/Algo-Pattern-blue?&logo=github)](https://github.com/zdong1995/Pattern-Summary-for-Algorithm-Problems) ![java](https://img.shields.io/badge/Language-Java-orange?logo=java) ![Build](https://github.com/zdong1995/Pattern-Summary-for-Algorithm-Problems/workflows/Build/badge.svg)  [![](https://img.shields.io/badge/Github-zdong1995-blue?style=social&logo=github)](https://github.com/zdong1995/)
 
 My summary of patterns for algorithm questions, based on similarities of techniques we used to solve the problem, with detailed beginner-friendly tutorial of Data Structure and Algorithm.
 
@@ -19,22 +19,20 @@ This repo will be updated as following parts:
 
 ### Table of Contents
 
-* [Fundamental](https://github.com/zdong1995/Algorithm-Interview#fundamental)
-* [Recursion](https://github.com/zdong1995/Algorithm-Interview#recursion)
-* [Two Pointers](https://github.com/zdong1995/Algorithm-Interview#two-pointers)
-* [Sorting](https://github.com/zdong1995/Algorithm-Interview#sorting)
-* [Breadth First Search \(BFS\)](https://github.com/zdong1995/Algorithm-Interview#bfs)
-* [Depth First Search \(DFS\)](https://github.com/zdong1995/Algorithm-Interview#dfs)
-* [Dynamic Programming \(DP\)](https://github.com/zdong1995/Algorithm-Interview#dp)
-* [Popular Problems](https://github.com/zdong1995/Algorithm-Interview#popular)
+* [Fundamental](https://github.com/zdong1995/Pattern-Summary-for-Algorithm-Problems#fundamental)
+* [Recursion](https://github.com/zdong1995/Pattern-Summary-for-Algorithm-Problems#recursion)
+* [Two Pointers](https://github.com/zdong1995/Pattern-Summary-for-Algorithm-Problems#two-pointers)
+* [Sorting](https://github.com/zdong1995/Pattern-Summary-for-Algorithm-Problems#sorting)
+* [Breadth First Search \(BFS\)](https://github.com/zdong1995/Pattern-Summary-for-Algorithm-Problems#bfs)
+* [Depth First Search \(DFS\)](https://github.com/zdong1995/Pattern-Summary-for-Algorithm-Problems#dfs)
+* [Dynamic Programming \(DP\)](https://github.com/zdong1995/Pattern-Summary-for-Algorithm-Problems#dp)
+* [Popular Problems](https://github.com/zdong1995/Pattern-Summary-for-Algorithm-Problems#popular)
 
 Popular interview algorithm problems summarized by different patterns.
 
 ### Fundamental
 
-* [ ] Introduction to Algorithms in Interview
-* [ ] Summary of Data Structure
-* [ ] Iterative in LinkedList
+* [x] Iterative in LinkedList: [Code](src/main/java/algorithm/basic/iterative)
 * [ ] Binary Search
 
 ### Recursion
@@ -46,7 +44,7 @@ Popular interview algorithm problems summarized by different patterns.
 
 ### Two Pointers
 
-* [x] Two Sum Pattern: [Code](src/main/java/algorithm/array/twosum)
+* [x] Two Sum Pattern: [Code](src/main/java/algorithm/pointers/twosum)
 * [ ] Slow-Fast Pointers
 * [ ] K-way Merge
 * [ ] Deduplication
diff --git a/README.md b/README.md
@@ -1,5 +1,5 @@
 # 零基础算法面试指南
-[![](https://img.shields.io/badge/LeetCode-Solution-yellow?logo=leetcode)](https://github.com/zdong1995/LeetCode-Solution-Well-Explained) [![](https://img.shields.io/badge/Algo-Interview-blue?&logo=github)](https://github.com/zdong1995/Algorithm-Interview) ![java](https://img.shields.io/badge/Language-Java-orange?logo=java) ![Build](https://github.com/zdong1995/Algorithm-Interview/workflows/Build/badge.svg)  [![](https://img.shields.io/badge/Github-zdong1995-blue?style=social&logo=github)](https://github.com/zdong1995/)
+[![](https://img.shields.io/badge/LeetCode-Solution-yellow?logo=leetcode)](https://github.com/zdong1995/LeetCode-Solution-Well-Explained) [![](https://img.shields.io/badge/Algo-Pattern-blue?&logo=github)](https://github.com/zdong1995/Pattern-Summary-for-Algorithm-Problems) ![java](https://img.shields.io/badge/Language-Java-orange?logo=java) ![Build](https://github.com/zdong1995/Pattern-Summary-for-Algorithm-Problems/workflows/Build/badge.svg)  [![](https://img.shields.io/badge/Github-zdong1995-blue?style=social&logo=github)](https://github.com/zdong1995/)
 
 [English Version](./README-EN.md)
 
@@ -12,11 +12,22 @@
 - 第二部分：掌握搜索算法，宽度优先，深度优先，到记忆存储，剪枝优化，入门动态规划。
 - 第三部分：高频面试题目分析，复杂题目讲解，高级数据结构等。
 
+### 目录
+
+1. [基础数据结构与算法](https://github.com/zdong1995/Pattern-Summary-for-Algorithm-Problems#fundamental)
+2. [优雅重要的递归思维](https://github.com/zdong1995/Pattern-Summary-for-Algorithm-Problems#recursion)
+3. [巧妙高效的双指针](https://github.com/zdong1995/Pattern-Summary-for-Algorithm-Problems#two-pointers)
+4. [轻松手写排序算法](https://github.com/zdong1995/Pattern-Summary-for-Algorithm-Problems#sorting)
+5. [宽度优先搜索 \(BFS\)](https://github.com/zdong1995/Pattern-Summary-for-Algorithm-Problems#bfs)
+6. [深度优先搜索 \(DFS\)](https://github.com/zdong1995/Pattern-Summary-for-Algorithm-Problems#dfs)
+7. [数学归纳法与动态规划 \(DP\)](https://github.com/zdong1995/Pattern-Summary-for-Algorithm-Problems#dp)
+8. [高频题目类型讲解](https://github.com/zdong1995/Pattern-Summary-for-Algorithm-Problems#popular)
+
 ### 1. 基础数据结构与算法 
 
 - [x] [半年零基础到 LeetCode 300 题，我的算法学习方法论](https://dongxiaoran.com/algo/basic/intro/)
 - [x] [当我们谈论刷题时，到底在刷什么](https://dongxiaoran.com/algo/basic/how/)
-- [x] [一题顶四题，一道题掌握 LinkedList 的 Iterative](https://dongxiaoran.com/algo/basic/iterativelist/)
+- [x] [一题顶四题，一道题掌握 LinkedList 的 Iterative](https://dongxiaoran.com/algo/basic/iterativelist/): [Code](src/main/java/algorithm/basic/iterative)
 
 - [ ] Binary Search
 
@@ -32,7 +43,7 @@
 
 ### 3. 巧妙高效的双指针
 
-- [x] Two Sum Pattern: [Code](src/main/java/algorithm/array/twosum)
+- [x] Two Sum Pattern: [Code](src/main/java/algorithm/pointers/twosum)
 - [ ] Slow-Fast Pointers
 
 - [ ] K-way Merge
@@ -51,7 +62,7 @@
 
 - [ ] Quick Selection
 
-- [ ] Comparasion-based Sort
+- [ ] Comparison-based Sort
 
 ### 5. 宽度优先搜索
 
diff --git a/src/main/java/algorithm/basic/iterative/FindMiddleOfList.java b/src/main/java/algorithm/basic/iterative/FindMiddleOfList.java
@@ -0,0 +1,4 @@
+package algorithm.basic.iterative;
+
+public class FindMiddleOfList {
+}
diff --git a/src/main/java/algorithm/basic/iterative/MergeTwoSortedList.java b/src/main/java/algorithm/basic/iterative/MergeTwoSortedList.java
@@ -0,0 +1,4 @@
+package algorithm.basic.iterative;
+
+public class MergeTwoSortedList {
+}
diff --git a/src/main/java/algorithm/basic/iterative/ReorderList.java b/src/main/java/algorithm/basic/iterative/ReorderList.java
@@ -0,0 +1,4 @@
+package algorithm.basic.iterative;
+
+public class ReorderList {
+}
diff --git a/src/main/java/algorithm/basic/iterative/ReverseLinkedList.java b/src/main/java/algorithm/basic/iterative/ReverseLinkedList.java
@@ -0,0 +1,4 @@
+package algorithm.basic.iterative;
+
+public class ReverseLinkedList {
+}
diff --git a/src/main/java/algorithm/linkedlist/merge/MergeSortLists.java b/src/main/java/algorithm/linkedlist/merge/MergeSortLists.java
diff --git a/src/main/java/algorithm/pointers/merge/MergeKSortedList.java b/src/main/java/algorithm/pointers/merge/MergeKSortedList.java
@@ -1,4 +1,4 @@
-package algorithm.linkedlist.merge;
+package algorithm.pointers.merge;
 
 import datastrcture.ListNode;
 import java.util.*;
diff --git a/src/main/java/algorithm/pointers/merge/MergeSortLists.java b/src/main/java/algorithm/pointers/merge/MergeSortLists.java
@@ -0,0 +1,4 @@
+package algorithm.pointers.merge;
+
+public class MergeSortLists {
+}
diff --git a/src/main/java/algorithm/pointers/merge/MergeTwoSortedList.java b/src/main/java/algorithm/pointers/merge/MergeTwoSortedList.java
@@ -1,4 +1,4 @@
-package algorithm.linkedlist.merge;
+package algorithm.pointers.merge;
 
 import datastrcture.ListNode;
 
diff --git a/src/main/java/algorithm/pointers/twosum/FourSum.java b/src/main/java/algorithm/pointers/twosum/FourSum.java
@@ -1,4 +1,4 @@
-package algorithm.array.twosum;
+package algorithm.pointers.twosum;
 
 import java.util.*;
 
diff --git a/src/main/java/algorithm/pointers/twosum/KSum.java b/src/main/java/algorithm/pointers/twosum/KSum.java
@@ -1,4 +1,4 @@
-package algorithm.array.twosum;
+package algorithm.pointers.twosum;
 
 import java.util.*;
 
diff --git a/src/main/java/algorithm/pointers/twosum/ThreeSum.java b/src/main/java/algorithm/pointers/twosum/ThreeSum.java
@@ -1,4 +1,4 @@
-package algorithm.array.twosum;
+package algorithm.pointers.twosum;
 
 import java.util.*;
 
diff --git a/src/main/java/algorithm/pointers/twosum/ThreeSumClosest.java b/src/main/java/algorithm/pointers/twosum/ThreeSumClosest.java
@@ -1,7 +1,6 @@
-package algorithm.array.twosum;
+package algorithm.pointers.twosum;
 
 import java.util.Arrays;
-import java.util.Map;
 
 /**
  * Given an array nums of n integers and an integer target.
diff --git a/src/main/java/algorithm/pointers/twosum/ThreeSumGreater.java b/src/main/java/algorithm/pointers/twosum/ThreeSumGreater.java
@@ -1,4 +1,4 @@
-package algorithm.array.twosum;
+package algorithm.pointers.twosum;
 
 import java.util.*;
 
diff --git a/src/main/java/algorithm/pointers/twosum/ThreeSumSmaller.java b/src/main/java/algorithm/pointers/twosum/ThreeSumSmaller.java
@@ -1,4 +1,4 @@
-package algorithm.array.twosum;
+package algorithm.pointers.twosum;
 
 import java.util.Arrays;
 
diff --git a/src/main/java/algorithm/pointers/twosum/TwoSum.java b/src/main/java/algorithm/pointers/twosum/TwoSum.java
@@ -1,6 +1,5 @@
-package algorithm.array.twosum;
+package algorithm.pointers.twosum;
 
-import java.util.Arrays;
 import java.util.HashMap;
 import java.util.Map;
 
diff --git a/src/main/java/algorithm/pointers/twosum/TwoSumAllPairs.java b/src/main/java/algorithm/pointers/twosum/TwoSumAllPairs.java
@@ -1,4 +1,4 @@
-package algorithm.array.twosum;
+package algorithm.pointers.twosum;
 
 import java.util.*;
 
diff --git a/src/main/java/algorithm/pointers/twosum/TwoSumAllUniquePairs.java b/src/main/java/algorithm/pointers/twosum/TwoSumAllUniquePairs.java
@@ -1,4 +1,4 @@
-package algorithm.array.twosum;
+package algorithm.pointers.twosum;
 
 import java.util.*;
 
diff --git a/src/main/java/algorithm/pointers/twosum/TwoSumClosest.java b/src/main/java/algorithm/pointers/twosum/TwoSumClosest.java
@@ -1,8 +1,6 @@
-package algorithm.array.twosum;
+package algorithm.pointers.twosum;
 
-import java.util.ArrayList;
 import java.util.Arrays;
-import java.util.List;
 
 /**
  * Find the pair of elements in a given array that sum to a value that is closest to the given target number.
diff --git a/src/main/java/algorithm/pointers/twosum/TwoSumDesign.java b/src/main/java/algorithm/pointers/twosum/TwoSumDesign.java
@@ -1,4 +1,4 @@
-package algorithm.array.twosum;
+package algorithm.pointers.twosum;
 
 import java.util.*;
 
diff --git a/src/main/java/algorithm/pointers/twosum/TwoSumDifference.java b/src/main/java/algorithm/pointers/twosum/TwoSumDifference.java
@@ -1,4 +1,4 @@
-package algorithm.array.twosum;
+package algorithm.pointers.twosum;
 
 import java.util.*;
 
diff --git a/src/main/java/algorithm/pointers/twosum/TwoSumGreater.java b/src/main/java/algorithm/pointers/twosum/TwoSumGreater.java
@@ -1,4 +1,4 @@
-package algorithm.array.twosum;
+package algorithm.pointers.twosum;
 
 import java.util.Arrays;
 
diff --git a/src/main/java/algorithm/pointers/twosum/TwoSumSmaller.java b/src/main/java/algorithm/pointers/twosum/TwoSumSmaller.java
@@ -1,4 +1,4 @@
-package algorithm.array.twosum;
+package algorithm.pointers.twosum;
 
 import java.util.Arrays;
 
diff --git a/src/main/java/algorithm/pointers/twosum/TwoSumSorted.java b/src/main/java/algorithm/pointers/twosum/TwoSumSorted.java
@@ -1,6 +1,4 @@
-package algorithm.array.twosum;
-
-import java.util.Arrays;
+package algorithm.pointers.twosum;
 
 /**
  * Given an sorted array of integers nums and an integer target,
diff --git a/src/main/java/algorithm/recursion/tree/construct/BSTFromPre.java b/src/main/java/algorithm/recursion/tree/construct/BSTFromPre.java
@@ -1,4 +1,4 @@
-package algorithm.tree.construct;
+package algorithm.recursion.tree.construct;
 
 import datastrcture.TreeNode;
 
diff --git a/src/main/java/algorithm/recursion/tree/construct/ConstructFromInPost.java b/src/main/java/algorithm/recursion/tree/construct/ConstructFromInPost.java
@@ -1,4 +1,4 @@
-package algorithm.tree.construct;
+package algorithm.recursion.tree.construct;
 
 import datastrcture.TreeNode;
 
diff --git a/src/main/java/algorithm/recursion/tree/construct/ConstructFromInPre.java b/src/main/java/algorithm/recursion/tree/construct/ConstructFromInPre.java
@@ -1,4 +1,4 @@
-package algorithm.tree.construct;
+package algorithm.recursion.tree.construct;
 
 import datastrcture.TreeNode;
 
diff --git a/src/main/java/algorithm/recursion/tree/construct/ConstructFromPrePost.java b/src/main/java/algorithm/recursion/tree/construct/ConstructFromPrePost.java
@@ -1,4 +1,4 @@
-package algorithm.tree.construct;
+package algorithm.recursion.tree.construct;
 
 import datastrcture.TreeNode;
 
diff --git a/src/main/java/algorithm/recursion/tree/lca/LCA.java b/src/main/java/algorithm/recursion/tree/lca/LCA.java
@@ -1,4 +1,4 @@
-package algorithm.tree.lca;
+package algorithm.recursion.tree.lca;
 
 import datastrcture.TreeNode;
 
diff --git a/src/main/java/algorithm/recursion/tree/lca/LCA2.java b/src/main/java/algorithm/recursion/tree/lca/LCA2.java
@@ -1,4 +1,4 @@
-package algorithm.tree.lca;
+package algorithm.recursion.tree.lca;
 
 import datastrcture.TreeNode;
 /**
diff --git a/src/main/java/algorithm/recursion/tree/lca/LCA3.java b/src/main/java/algorithm/recursion/tree/lca/LCA3.java
@@ -1,4 +1,4 @@
-package algorithm.tree.lca;
+package algorithm.recursion.tree.lca;
 
 import java.util.*;
 
diff --git a/src/main/java/algorithm/recursion/tree/lca/LCAOfBST.java b/src/main/java/algorithm/recursion/tree/lca/LCAOfBST.java
@@ -1,4 +1,4 @@
-package algorithm.tree.lca;
+package algorithm.recursion.tree.lca;
 
 import datastrcture.TreeNode;
 
diff --git a/src/main/java/algorithm/recursion/tree/lca/LCAOfKNode.java b/src/main/java/algorithm/recursion/tree/lca/LCAOfKNode.java
@@ -1,4 +1,4 @@
-package algorithm.tree.lca;
+package algorithm.recursion.tree.lca;
 
 import datastrcture.TreeNode;
 
diff --git a/src/main/java/algorithm/recursion/tree/lca/LCAOfKnaryMNode.java b/src/main/java/algorithm/recursion/tree/lca/LCAOfKnaryMNode.java
@@ -1,4 +1,4 @@
-package algorithm.tree.lca;
+package algorithm.recursion.tree.lca;
 
 import datastrcture.KnaryTreeNode;
 
diff --git a/src/main/java/algorithm/recursion/tree/lca/LCAOfKnaryTree.java b/src/main/java/algorithm/recursion/tree/lca/LCAOfKnaryTree.java
@@ -1,4 +1,4 @@
-package algorithm.tree.lca;
+package algorithm.recursion.tree.lca;
 
 import datastrcture.KnaryTreeNode;
 
diff --git a/src/main/java/algorithm/recursion/tree/pathsum/MaxPathSumNodeToNode.java b/src/main/java/algorithm/recursion/tree/pathsum/MaxPathSumNodeToNode.java
@@ -1,4 +1,4 @@
-package algorithm.tree.pathsum;
+package algorithm.recursion.tree.pathsum;
 
 import datastrcture.TreeNode;
 
diff --git a/src/main/java/algorithm/sort/QuickSort.java b/src/main/java/algorithm/sort/QuickSort.java
@@ -1,4 +1,4 @@
-package algorithm.array.sort;
+package algorithm.sort;
 
 public class QuickSort {
   private void quickSort(int[] array, int left, int right) {

-Original file line number
+Diff line change
@@ @@ -0,0 +1,4 @@ @@
 +package algorithm.basic.iterative;
++
 +public class FindMiddleOfList {
 +}
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package algorithm.linkedlist.merge;`
	`1`	`+package algorithm.pointers.merge;`
`2`	`2`
`3`	`3`	`import datastrcture.ListNode;`
`4`	`4`	`import java.util.*;`