classfication question2

zhangyu345293721 · zhangyu345293721 · commit f404d3522c38 · 2019-01-13T14:31:34.000+08:00
diff --git a/.idea/workspace.xml b/.idea/workspace.xml
diff --git a/src/SearchIndex.java b/src/SearchIndex.java
@@ -5,7 +5,7 @@
  * @version V1.0
  * @ClassName: SearchIndex
  * @Description: TOTO
- * @date 2018/11/20 13:35
+ * @date 2018/12/20 13:35
  **/
 
 
diff --git a/src/SearchIndex2.java b/src/SearchIndex2.java
@@ -5,7 +5,7 @@
  * @version V1.0
  * @ClassName: SearchIndex2
  * @Description: TOTO
- * @date 2018/11/20 14:03
+ * @date 2018/12/20 14:03
  **/
 
 public class SearchIndex2 {
diff --git a/src/TopKTest.java b/src/TopKTest.java
@@ -7,7 +7,7 @@
  * @version V1.0
  * @ClassName: TopKTest
  * @Description: TOTO
- * @date 2018/11/20 20:29
+ * @date 2018/12/21 20:29
  **/
 
 public class TopKTest {
diff --git a/src/TopKTest2.java b/src/TopKTest2.java
@@ -9,7 +9,7 @@
  * @version V1.0
  * @ClassName: TopKTest2
  * @Description: TOTO
- * @date 2018/11/20 21:03
+ * @date 2018/12/21 21:03
  **/
 
 
diff --git a/src/leetcode/BestTimeBuySell.java b/src/leetcode/BestTimeBuySell.java
@@ -7,7 +7,7 @@
  * @version V1.0
  * @ClassName: BestTimeBuySell
  * @Description: 最好时间买和卖股票
- * @date 2018/12/17 18:43
+ * @date 2018/11/17 18:43
  **/
 
 
diff --git a/src/leetcode/BitCount.java b/src/leetcode/BitCount.java
@@ -7,7 +7,7 @@
  * @version V1.0
  * @ClassName: BitCount
  * @Description: 把数字换成二进制，计算二进制的中1的个数
- * @date 2018/12/17 9:19
+ * @date 2018/11/18 9:19
  **/
 
 
diff --git a/src/leetcode/CapPartition.java b/src/leetcode/CapPartition.java
@@ -8,7 +8,7 @@
  * @version V1.0
  * @ClassName: CapPartition
  * @Description: 动态规划，计算该数组是不是可以分成平等的两部分
- * @date 2018/12/10 10:30
+ * @date 2018/11/18 10:30
  **/
 
 public class CapPartition {
diff --git a/src/leetcode/CombinationSum.java b/src/leetcode/CombinationSum.java
@@ -11,7 +11,7 @@
  * @version V1.0
  * @ClassName: CombinationSum
  * @Description: TOTO
- * @date 2018/12/11 19:31
+ * @date 2018/11/19 19:31
  **/
 
 
diff --git a/src/leetcode/ContainerWithMostWater.java b/src/leetcode/ContainerWithMostWater.java
@@ -7,7 +7,7 @@
  * @version V1.0
  * @ClassName: ContainerWithMostWater
  * @Description: TOTO
- * @date 2018/12/15 20:48
+ * @date 2018/11/19 20:48
  **/
 
 
diff --git a/src/leetcode/DecodeString.java b/src/leetcode/DecodeString.java
@@ -9,7 +9,7 @@
  * @version V1.0
  * @ClassName: DecodeString
  * @Description: TOTO
- * @date 2018/12/11 11:36
+ * @date 2018/11/19 11:36
  **/
 
 // 这种方式没有做出来，如果是循环嵌套的话就有问题
diff --git a/src/leetcode/EqualsIgnoreOrderString.java b/src/leetcode/EqualsIgnoreOrderString.java
@@ -11,7 +11,7 @@
  * @version V1.0
  * @ClassName: EqualsIgnoreOrderString
  * @Description: TOTO
- * @date 2018/12/5 18:35
+ * @date 2018/11/20 18:35
  **/
 
 
diff --git a/src/leetcode/FindAllAnagrams.java b/src/leetcode/FindAllAnagrams.java
@@ -12,7 +12,7 @@
  * @version V1.0
  * @ClassName: FindAllAnagrams
  * @Description: TOTO
- * @date 2018/12/5 17:22
+ * @date 2018/11/20 17:22
  **/
 
 
diff --git a/src/leetcode/FindAllAnagrams2.java b/src/leetcode/FindAllAnagrams2.java
@@ -10,7 +10,7 @@
  * @version V1.0
  * @ClassName: FindAllAnagrams
  * @Description: TOTO
- * @date 2018/12/5 17:22
+ * @date 2018/11/20 17:22
  **/
 
 
diff --git a/src/leetcode/FindDisappearedNumbers.java b/src/leetcode/FindDisappearedNumbers.java
@@ -11,7 +11,7 @@
  * @version V1.0
  * @ClassName: FindDisappearedNumbers
  * @Description: 找出一个数组中没有出现的数字
- * @date 2018/12/2 19:40
+ * @date 2018/11/20 19:40
  **/
 
 
diff --git a/src/leetcode/FindDisappearedNumbers2.java b/src/leetcode/FindDisappearedNumbers2.java
@@ -10,7 +10,7 @@
  * @version V1.0
  * @ClassName: FindDisappearedNumbers
  * @Description: 找出一个数组中没有出现的数字
- * @date 2018/12/2 19:40
+ * @date 2018/11/20 19:40
  **/
 
 
diff --git a/src/leetcode/FindDuplicateNumber.java b/src/leetcode/FindDuplicateNumber.java
@@ -11,7 +11,7 @@
  * @version V1.0
  * @ClassName: FindDuplicateNumber
  * @Description: TOTO
- * @date 2018/12/15 15:32
+ * @date 2018/11/21 15:32
  **/
 
 
diff --git a/src/leetcode/FindMediaTwoSortArray.java b/src/leetcode/FindMediaTwoSortArray.java
@@ -9,7 +9,7 @@
  * @ClassName: MergeSortArray
  * @Description: 这个题目在leetcode被编为hard类型，我这种做法居然还有这么高的效率，有点不太相信
  * Runtime: 28 ms, faster than 86.93% of Java online submissions for Median of Two Sorted Arrays.
- * @date 2018/12/7 15:12
+ * @date 2018/11/22 15:12
  **/
 
 public class FindMediaTwoSortArray {
diff --git a/src/leetcode/GenericityTest.java b/src/leetcode/GenericityTest.java
@@ -7,7 +7,7 @@
  * @version V1.0
  * @ClassName: GenericityTest
  * @Description: TOTO
- * @date 2018/12/17 20:38
+ * @date 2018/11/22 20:38
  **/
 
 
diff --git a/src/leetcode/GroupAnagrams.java b/src/leetcode/GroupAnagrams.java
@@ -11,7 +11,7 @@
  * @version V1.0
  * @ClassName: GroupAnagrams
  * @Description: TOTO
- * @date 2018/12/14 16:56
+ * @date 2018/11/23 16:56
  **/
 
 /**
diff --git a/src/leetcode/GroupAnagrams2.java b/src/leetcode/GroupAnagrams2.java
@@ -12,7 +12,7 @@
  * @version V1.0
  * @ClassName: GroupAnagrams
  * @Description: TOTO
- * @date 2018/12/14 16:56
+ * @date 2018/11/23 16:56
  **/
 
 /**
diff --git a/src/leetcode/GroupAnagrams3.java b/src/leetcode/GroupAnagrams3.java
@@ -9,7 +9,7 @@
  * @version V1.0
  * @ClassName: GroupAnagrams
  * @Description: TOTO
- * @date 2018/12/14 16:56
+ * @date 2018/11/24 16:56
  **/
 
 /**
diff --git a/src/leetcode/KthLargestElement.java b/src/leetcode/KthLargestElement.java
@@ -13,7 +13,7 @@
  * @version V1.0
  * @ClassName: KthLargestElement
  * @Description: TOTO
- * @date 2018/12/13 17:23
+ * @date 2018/11/25 17:23
  **/
 
 
diff --git a/src/leetcode/LetterCombinationsPhoneNumber.java b/src/leetcode/LetterCombinationsPhoneNumber.java
@@ -10,7 +10,7 @@
  * @version V1.0
  * @ClassName: LetterCombinationsPhoneNumber
  * @Description: TOTO
- * @date 2018/12/17 15:37
+ * @date 2018/11/26 15:37
  **/
 
 
diff --git a/src/leetcode/LetterCombinationsPhoneNumber2.java b/src/leetcode/LetterCombinationsPhoneNumber2.java
@@ -10,7 +10,7 @@
  * @version V1.0
  * @ClassName: LetterCombinationsPhoneNumber
  * @Description: TOTO
- * @date 2018/12/17 15:37
+ * @date 2018/11/26 15:37
  **/
 
 
diff --git a/src/leetcode/LetterCombinationsPhoneNumber3.java b/src/leetcode/LetterCombinationsPhoneNumber3.java
@@ -10,7 +10,7 @@
  * @version V1.0
  * @ClassName: LetterCombinationsPhoneNumber
  * @Description: TOTO
- * @date 2018/12/17 15:37
+ * @date 2018/11/26 15:37
  **/
 
 
diff --git a/src/leetcode/ListTest.java b/src/leetcode/ListTest.java
@@ -11,7 +11,7 @@
  * @version V1.0
  * @ClassName: ListTest
  * @Description: TOTO
- * @date 2018/12/11 10:01
+ * @date 2018/11/28 10:01
  **/
 
 public class ListTest {
diff --git a/src/leetcode/LongestConsecutiveSequence.java b/src/leetcode/LongestConsecutiveSequence.java
@@ -11,7 +11,7 @@
  * @version V1.0
  * @ClassName: LongestConsecutiveSequence
  * @Description: TOTO
- * @date 2018/12/14 15:25
+ * @date 2018/11/28 15:25
  **/
 
 
diff --git a/src/leetcode/LongestIncreasingSubsequence.java b/src/leetcode/LongestIncreasingSubsequence.java
@@ -7,7 +7,7 @@
  * @version V1.0
  * @ClassName: LongestIncreasingSubsequence
  * @Description: TOTO
- * @date 2018/12/12 21:04
+ * @date 2018/11/28 21:04
  **/
 
 // 凡事最小最大问题，都考考虑动态规划
diff --git a/src/leetcode/LongestIncreasingSubsequence2.java b/src/leetcode/LongestIncreasingSubsequence2.java
@@ -9,7 +9,7 @@
  * @version V1.0
  * @ClassName: LongestIncreasingSubsequence
  * @Description: TOTO
- * @date 2018/12/12 21:04
+ * @date 2018/11/28 21:04
  **/
 
 // 凡是最小最大问题，最先考虑动态规划
diff --git a/src/leetcode/LongestPalindromicSubstring.java b/src/leetcode/LongestPalindromicSubstring.java
@@ -7,7 +7,7 @@
  * @version V1.0
  * @ClassName: LongestPalindromicSubstring
  * @Description: TOTO
- * @date 2018/12/6 19:12
+ * @date 2018/11/29 19:12
  **/
 
 
diff --git a/src/leetcode/LongestPalindromicSubstring2.java b/src/leetcode/LongestPalindromicSubstring2.java
@@ -7,7 +7,7 @@
  * @version V1.0
  * @ClassName: LongestPalindromicSubstring
  * @Description: TOTO
- * @date 2018/12/6 19:12
+ * @date 2018/11/29 19:12
  **/
 
 
diff --git a/src/leetcode/LongestPalindromicSubstring3.java b/src/leetcode/LongestPalindromicSubstring3.java
@@ -7,7 +7,7 @@
  * @version V1.0
  * @ClassName: LongestPalindromicSubstring
  * @Description: TOTO
- * @date 2018/12/6 20:18
+ * @date 2018/11/29 20:18
  **/
 
 
diff --git a/src/leetcode/LongestSubstringWithoutRepeatingCharacters.java b/src/leetcode/LongestSubstringWithoutRepeatingCharacters.java
@@ -11,7 +11,7 @@
  * @version V1.0
  * @ClassName: LongestSubstringWithoutRepeatingCharacters
  * @Description: 找出一个字符串中最大的无重复子字符串
- * @date 2018/12/4 10:57
+ * @date 2018/11/30 10:57
  **/
 
 
diff --git a/src/leetcode/LongestSubstringWithoutRepeatingCharacters2.java b/src/leetcode/LongestSubstringWithoutRepeatingCharacters2.java
@@ -12,7 +12,7 @@
  * @version V1.0
  * @ClassName: LongestSubstringWithoutRepeatingCharacters
  * @Description: 最简单，最直接的一种暴力算法
- * @date 2018/12/4 10:57
+ * @date 2018/11/30 10:57
  **/
 
 
diff --git a/src/leetcode/MergeKSortedLists.java b/src/leetcode/MergeKSortedLists.java
@@ -10,7 +10,7 @@
  * @version V1.0
  * @ClassName: MergeKSortedLists
  * @Description: TOTO
- * @date 2018/12/13 19:31
+ * @date 2018/12/12 19:31
  **/
 
 
diff --git a/src/leetcode/TargetSum.java b/src/leetcode/TargetSum.java
@@ -11,7 +11,7 @@
  * @version V1.0
  * @ClassName: TargetSum
  * @Description: TOTO
- * @date 2018/11/29 20:59
+ * @date 2018/12/24 20:59
  **/
 
 
diff --git a/src/leetcode/TargetSum2.java b/src/leetcode/TargetSum2.java
@@ -9,7 +9,7 @@
  * @version V1.0
  * @ClassName: TargetSum
  * @Description: TOTO
- * @date 2018/11/29 20:59
+ * @date 2018/12/24 20:59
  **/
 
 
diff --git a/src/leetcode/TargetSum3.java b/src/leetcode/TargetSum3.java
@@ -9,7 +9,7 @@
  * @version V1.0
  * @ClassName: TargetSum
  * @Description: TOTO
- * @date 2018/11/29 20:59
+ * @date 2018/11/24 20:59
  **/
 
 
diff --git a/src/leetcode/arraytest/MaximumSubarray.java b/src/leetcode/arraytest/MaximumSubarray.java
@@ -7,7 +7,7 @@
  * @version V1.0
  * @ClassName: MaximumSubarray
  * @Description: 动态规划没有做出来，状态转换方程有点问题
- * @date 2018/12/6 9:41
+ * @date 2018/11/7 9:41
  **/
 
 
diff --git a/src/leetcode/arraytest/MaximumSubarray2.java b/src/leetcode/arraytest/MaximumSubarray2.java
@@ -7,7 +7,7 @@
  * @version V1.0
  * @ClassName: MaximumSubarray
  * @Description:
- * @date 2018/12/6 9:41
+ * @date 2018/11/7 9:41
  **/
 
 
diff --git a/src/leetcode/arraytest/MaximumSubarray3.java b/src/leetcode/arraytest/MaximumSubarray3.java
@@ -7,7 +7,7 @@
  * @version V1.0
  * @ClassName: MaximumSubarray
  * @Description: 这种是采用动态规划的方式进行求解
- * @date 2018/12/6 9:41
+ * @date 2018/11/7 9:41
  **/
 
 
diff --git a/src/leetcode/dynamicprogramming/ClimbingStairs.java b/src/leetcode/dynamicprogramming/ClimbingStairs.java
@@ -7,7 +7,7 @@
  * @version V1.0
  * @ClassName: ClimbingStairs
  * @Description: 利用动态规划来计算爬楼梯问题
- * @date 2018/12/5 16:22
+ * @date 2018/11/2 16:22
  **/
 
 
diff --git a/src/leetcode/dynamicprogramming/HouseRobber1.java b/src/leetcode/dynamicprogramming/HouseRobber1.java
@@ -9,7 +9,7 @@
  * @version V1.0
  * @ClassName: HouseRobber1
  * @Description: 这是一个动态规划的考题，这种方式只是做出来其中的一种，里面还有别的做法
- * @date 2018/12/4 17:11
+ * @date 2018/11/4 17:11
  */
 
 public class HouseRobber1 {
diff --git a/src/leetcode/dynamicprogramming/HouseRobber2.java b/src/leetcode/dynamicprogramming/HouseRobber2.java
@@ -10,7 +10,7 @@
  * @version V1.0
  * @ClassName: HouseRobber1
  * @Description: 这是一个动态规划的考题，这种方式只是做出来其中的一种，里面还有别的做法
- * @date 2018/12/4 17:11
+ * @date 2018/11/4 17:11
  */
 
 public class HouseRobber2 {
diff --git a/src/leetcode/dynamicprogramming/HouseRobber3.java b/src/leetcode/dynamicprogramming/HouseRobber3.java
diff --git a/src/leetcode/dynamicprogramming/HouseRobber4.java b/src/leetcode/dynamicprogramming/HouseRobber4.java
diff --git a/src/leetcode/testlist/BigPriorityQueue.java b/src/leetcode/testlist/BigPriorityQueue.java
diff --git a/src/leetcode/testlist/SortStringTest.java b/src/leetcode/testlist/SortStringTest.java
diff --git a/src/leetcode/testlist/TestTreeNode.java b/src/leetcode/testlist/TestTreeNode.java
diff --git a/src/leetcode/testlist/TreeNode.java b/src/leetcode/testlist/TreeNode.java
diff --git a/src/leetcode/testlist/dynamicProgramSample.java b/src/leetcode/testlist/dynamicProgramSample.java
