change something about practice project

qixiangyang · Jul 5, 2019 · bc644e8 · bc644e8
1 parent e8a4f50
commit bc644e8
Show file tree

Hide file tree

Showing 110 changed files with 111 additions and 12 deletions.
diff --git a/.idea/learning_project.iml → .idea/Practice.iml b/.idea/learning_project.iml → .idea/Practice.iml
diff --git a/algorithm/chapter1/binary_search.py → Algorithm/book_practice/binary_search.py b/algorithm/chapter1/binary_search.py → Algorithm/book_practice/binary_search.py
diff --git a/algorithm/chapter1/dick_tesla.py → Algorithm/book_practice/dick_tesla.py b/algorithm/chapter1/dick_tesla.py → Algorithm/book_practice/dick_tesla.py
diff --git a/algorithm/chapter1/divide_and_conquer.py → ...rithm/book_practice/divide_and_conquer.py b/algorithm/chapter1/divide_and_conquer.py → ...rithm/book_practice/divide_and_conquer.py
diff --git a/algorithm/chapter1/graph_search.py → Algorithm/book_practice/graph_search.py b/algorithm/chapter1/graph_search.py → Algorithm/book_practice/graph_search.py
diff --git a/algorithm/chapter1/quick_sort.py → Algorithm/book_practice/quick_sort.py b/algorithm/chapter1/quick_sort.py → Algorithm/book_practice/quick_sort.py
diff --git a/algorithm/chapter1/recursion.py → Algorithm/book_practice/recursion.py b/algorithm/chapter1/recursion.py → Algorithm/book_practice/recursion.py
diff --git a/python_basic_prctice/recursion.py → Algorithm/recursion.py b/python_basic_prctice/recursion.py → Algorithm/recursion.py
diff --git a/algorithm/sort/bubble_sort.py → Algorithm/sort/bubble_sort.py b/algorithm/sort/bubble_sort.py → Algorithm/sort/bubble_sort.py
diff --git a/algorithm/sort/bucket_sort.py → Algorithm/sort/bucket_sort.py b/algorithm/sort/bucket_sort.py → Algorithm/sort/bucket_sort.py
diff --git a/algorithm/sort/count_sort.py → Algorithm/sort/count_sort.py b/algorithm/sort/count_sort.py → Algorithm/sort/count_sort.py
diff --git a/algorithm/sort/heap_sort.py → Algorithm/sort/heap_sort.py b/algorithm/sort/heap_sort.py → Algorithm/sort/heap_sort.py
diff --git a/algorithm/sort/insert_sort.py → Algorithm/sort/insert_sort.py b/algorithm/sort/insert_sort.py → Algorithm/sort/insert_sort.py
diff --git a/algorithm/sort/merge_sort.py → Algorithm/sort/merge_sort.py b/algorithm/sort/merge_sort.py → Algorithm/sort/merge_sort.py
diff --git a/algorithm/sort/quick_sort.py → Algorithm/sort/quick_sort.py b/algorithm/sort/quick_sort.py → Algorithm/sort/quick_sort.py
diff --git a/algorithm/sort/radix_sort.py → Algorithm/sort/radix_sort.py b/algorithm/sort/radix_sort.py → Algorithm/sort/radix_sort.py
diff --git a/algorithm/sort/readme.md → Algorithm/sort/readme.md b/algorithm/sort/readme.md → Algorithm/sort/readme.md
diff --git a/algorithm/sort/select_sort.py → Algorithm/sort/select_sort.py b/algorithm/sort/select_sort.py → Algorithm/sort/select_sort.py
diff --git a/algorithm/sort/shell_sort.py → Algorithm/sort/shell_sort.py b/algorithm/sort/shell_sort.py → Algorithm/sort/shell_sort.py
diff --git a/data_structure/Linked List/linked_list.py → Data_Structure/Linked List/linked_list.py b/data_structure/Linked List/linked_list.py → Data_Structure/Linked List/linked_list.py
diff --git a/data_structure/Queue/Deque.py → Data_Structure/Queue/Deque.py b/data_structure/Queue/Deque.py → Data_Structure/Queue/Deque.py
diff --git a/data_structure/Queue/Queue.py → Data_Structure/Queue/Queue.py b/data_structure/Queue/Queue.py → Data_Structure/Queue/Queue.py
diff --git a/data_structure/Stack/Stack.py → Data_Structure/Stack/Stack.py b/data_structure/Stack/Stack.py → Data_Structure/Stack/Stack.py
diff --git a/Excellent_Cases/__init__.py b/Excellent_Cases/__init__.py
@@ -0,0 +1,6 @@
+"""
+Description:
+Author:qxy
+Date: 2019-07-05 17:43
+File: __init__.py 
+"""
diff --git a/sogou_spider/.gitignore → Excellent_Cases/sogou_spider/.gitignore b/sogou_spider/.gitignore → Excellent_Cases/sogou_spider/.gitignore
diff --git a/sogou_spider/LICENSE → Excellent_Cases/sogou_spider/LICENSE b/sogou_spider/LICENSE → Excellent_Cases/sogou_spider/LICENSE
diff --git a/sogou_spider/README.md → Excellent_Cases/sogou_spider/README.md b/sogou_spider/README.md → Excellent_Cases/sogou_spider/README.md
diff --git a/Excellent_Cases/sogou_spider/__init__.py b/Excellent_Cases/sogou_spider/__init__.py
@@ -0,0 +1,6 @@
+"""
+Description:
+Author:qxy
+Date: 2019-07-05 17:43
+File: __init__.py 
+"""
diff --git a/sogou_spider/setup.py → Excellent_Cases/sogou_spider/setup.py b/sogou_spider/setup.py → Excellent_Cases/sogou_spider/setup.py
diff --git a/sogou_spider/sgwc/__init__.py → ...llent_Cases/sogou_spider/sgwc/__init__.py b/sogou_spider/sgwc/__init__.py → ...llent_Cases/sogou_spider/sgwc/__init__.py
diff --git a/sogou_spider/sgwc/setting.py → Excellent_Cases/sogou_spider/sgwc/setting.py b/sogou_spider/sgwc/setting.py → Excellent_Cases/sogou_spider/sgwc/setting.py
diff --git a/sogou_spider/sgwc/sogou.py → Excellent_Cases/sogou_spider/sgwc/sogou.py b/sogou_spider/sgwc/sogou.py → Excellent_Cases/sogou_spider/sgwc/sogou.py
diff --git a/sogou_spider/sgwc/wechat.py → Excellent_Cases/sogou_spider/sgwc/wechat.py b/sogou_spider/sgwc/wechat.py → Excellent_Cases/sogou_spider/sgwc/wechat.py
diff --git a/test.py → Excellent_Cases/test.py b/test.py → Excellent_Cases/test.py
@@ -1,4 +1,4 @@
-from sogou_spider.sgwc import search_officials
+from Excellent_Cases.sogou_spider.sgwc import search_officials
 
 officials = search_officials(keyword='阿尔法工场')
 

diff --git a/leetcode/00001.py → Leetcode/00001.py b/leetcode/00001.py → Leetcode/00001.py
diff --git a/leetcode/00003.py → Leetcode/00003.py b/leetcode/00003.py → Leetcode/00003.py
diff --git a/...code/00004_median_of_two_sorted_arrays.py → ...code/00004_median_of_two_sorted_arrays.py b/...code/00004_median_of_two_sorted_arrays.py → ...code/00004_median_of_two_sorted_arrays.py
diff --git a/leetcode/00005_longestPalindrome.py → Leetcode/00005_longestPalindrome.py b/leetcode/00005_longestPalindrome.py → Leetcode/00005_longestPalindrome.py
diff --git a/leetcode/00007_reverse_integer.py → Leetcode/00007_reverse_integer.py b/leetcode/00007_reverse_integer.py → Leetcode/00007_reverse_integer.py
diff --git a/leetcode/00009_Palindrome.py → Leetcode/00009_Palindrome.py b/leetcode/00009_Palindrome.py → Leetcode/00009_Palindrome.py
diff --git a/leetcode/00013_romanToInt.py → Leetcode/00013_romanToInt.py b/leetcode/00013_romanToInt.py → Leetcode/00013_romanToInt.py
diff --git a/leetcode/00014_longestCommonPrefix.py → Leetcode/00014_longestCommonPrefix.py b/leetcode/00014_longestCommonPrefix.py → Leetcode/00014_longestCommonPrefix.py
diff --git a/leetcode/00020_isValid.py → Leetcode/00020_isValid.py b/leetcode/00020_isValid.py → Leetcode/00020_isValid.py
diff --git a/leetcode/00022_generateParenthesis.py → Leetcode/00022_generateParenthesis.py b/leetcode/00022_generateParenthesis.py → Leetcode/00022_generateParenthesis.py
diff --git a/leetcode/00023_removeElement.py → Leetcode/00023_removeElement.py b/leetcode/00023_removeElement.py → Leetcode/00023_removeElement.py
diff --git a/leetcode/00026_removeDuplicates.py → Leetcode/00026_removeDuplicates.py b/leetcode/00026_removeDuplicates.py → Leetcode/00026_removeDuplicates.py
diff --git a/leetcode/00028_strStr.py → Leetcode/00028_strStr.py b/leetcode/00028_strStr.py → Leetcode/00028_strStr.py
diff --git a/leetcode/00035_search_insert_position.py → Leetcode/00035_search_insert_position.py b/leetcode/00035_search_insert_position.py → Leetcode/00035_search_insert_position.py
diff --git a/leetcode/00058_length_of_last_word.py → Leetcode/00058_length_of_last_word.py b/leetcode/00058_length_of_last_word.py → Leetcode/00058_length_of_last_word.py
diff --git a/leetcode/00066_plus_one.py → Leetcode/00066_plus_one.py b/leetcode/00066_plus_one.py → Leetcode/00066_plus_one.py
diff --git a/leetcode/00069_sqrtx.py → Leetcode/00069_sqrtx.py b/leetcode/00069_sqrtx.py → Leetcode/00069_sqrtx.py
diff --git a/leetcode/00088_merge_sorted_array.py → Leetcode/00088_merge_sorted_array.py b/leetcode/00088_merge_sorted_array.py → Leetcode/00088_merge_sorted_array.py
diff --git a/leetcode/00118_pascals_triangle.py → Leetcode/00118_pascals_triangle.py b/leetcode/00118_pascals_triangle.py → Leetcode/00118_pascals_triangle.py
diff --git a/leetcode/00125_valid_palindrome.py → Leetcode/00125_valid_palindrome.py b/leetcode/00125_valid_palindrome.py → Leetcode/00125_valid_palindrome.py
diff --git a/leetcode/00136_single_number.py → Leetcode/00136_single_number.py b/leetcode/00136_single_number.py → Leetcode/00136_single_number.py
diff --git a/leetcode/00137_single_number_ii.py → Leetcode/00137_single_number_ii.py b/leetcode/00137_single_number_ii.py → Leetcode/00137_single_number_ii.py
diff --git a/leetcode/00169_majority_element.py → Leetcode/00169_majority_element.py b/leetcode/00169_majority_element.py → Leetcode/00169_majority_element.py
diff --git a/leetcode/00191_number_of_1_bits.py → Leetcode/00191_number_of_1_bits.py b/leetcode/00191_number_of_1_bits.py → Leetcode/00191_number_of_1_bits.py
diff --git a/leetcode/00198_house_robber.py → Leetcode/00198_house_robber.py b/leetcode/00198_house_robber.py → Leetcode/00198_house_robber.py
diff --git a/leetcode/00202_happy_number.py → Leetcode/00202_happy_number.py b/leetcode/00202_happy_number.py → Leetcode/00202_happy_number.py
diff --git a/leetcode/00217_contains_duplicate.py → Leetcode/00217_contains_duplicate.py b/leetcode/00217_contains_duplicate.py → Leetcode/00217_contains_duplicate.py
diff --git a/leetcode/00219_contains_duplicate_ii.py → Leetcode/00219_contains_duplicate_ii.py b/leetcode/00219_contains_duplicate_ii.py → Leetcode/00219_contains_duplicate_ii.py
diff --git a/leetcode/00240_search-a-2d-matrix-ii.py → Leetcode/00240_search-a-2d-matrix-ii.py b/leetcode/00240_search-a-2d-matrix-ii.py → Leetcode/00240_search-a-2d-matrix-ii.py
diff --git a/leetcode/00258_add_digits.py → Leetcode/00258_add_digits.py b/leetcode/00258_add_digits.py → Leetcode/00258_add_digits.py
diff --git a/leetcode/00260_single_number_iii.py → Leetcode/00260_single_number_iii.py b/leetcode/00260_single_number_iii.py → Leetcode/00260_single_number_iii.py
diff --git a/leetcode/00263_ugly_number.py → Leetcode/00263_ugly_number.py b/leetcode/00263_ugly_number.py → Leetcode/00263_ugly_number.py
diff --git a/leetcode/00509_fibonacci_number.py → Leetcode/00509_fibonacci_number.py b/leetcode/00509_fibonacci_number.py → Leetcode/00509_fibonacci_number.py
diff --git a/leetcode/00976_largest_perimeter_triangle.py → Leetcode/00976_largest_perimeter_triangle.py b/leetcode/00976_largest_perimeter_triangle.py → Leetcode/00976_largest_perimeter_triangle.py
diff --git a/leetcode/_00002.py → Leetcode/_00002.py b/leetcode/_00002.py → Leetcode/_00002.py
diff --git a/leetcode/_00038_count_and_say.py → Leetcode/_00038_count_and_say.py b/leetcode/_00038_count_and_say.py → Leetcode/_00038_count_and_say.py
diff --git a/leetcode/_00053_maximum_subarray.py → Leetcode/_00053_maximum_subarray.py b/leetcode/_00053_maximum_subarray.py → Leetcode/_00053_maximum_subarray.py
diff --git a/leetcode/_00067_add_binary.py → Leetcode/_00067_add_binary.py b/leetcode/_00067_add_binary.py → Leetcode/_00067_add_binary.py
diff --git a/leetcode/_00070_climbing_stairs.py → Leetcode/_00070_climbing_stairs.py b/leetcode/_00070_climbing_stairs.py → Leetcode/_00070_climbing_stairs.py
@@ -32,4 +32,10 @@
 
 
 def climbStairs(n: int) -> int:
-    pass
+    a, b = 1, 1
+    for _ in range(1, n-1):
+        a, b = a+b, a
+    return a
+
+
+print(climbStairs(7))
diff --git a/leetcode/_00204_count_primes.py → Leetcode/_00204_count_primes.py b/leetcode/_00204_count_primes.py → Leetcode/_00204_count_primes.py
diff --git a/leetcode/_00205_isomorphic_strings.py → Leetcode/_00205_isomorphic_strings.py b/leetcode/_00205_isomorphic_strings.py → Leetcode/_00205_isomorphic_strings.py
diff --git a/leetcode/_00220_contains_duplicate_iii.py → Leetcode/_00220_contains_duplicate_iii.py b/leetcode/_00220_contains_duplicate_iii.py → Leetcode/_00220_contains_duplicate_iii.py
diff --git a/Leetcode/_00746_min_cost_climbing_stairs.py b/Leetcode/_00746_min_cost_climbing_stairs.py
@@ -0,0 +1,84 @@
+"""
+Description:
+Author:qxy
+Date: 2019-07-04 14:07
+File: 00746_min_cost_climbing_stairs 
+"""
+
+"""
+数组的每个索引做为一个阶梯，第 i个阶梯对应着一个非负数的体力花费值 cost[i](索引从0开始)。
+
+每当你爬上一个阶梯你都要花费对应的体力花费值，然后你可以选择继续爬一个阶梯或者爬两个阶梯。
+
+您需要找到达到楼层顶部的最低花费。在开始时，你可以选择从索引为 0 或 1 的元素作为初始阶梯。
+
+示例 1:
+
+输入: cost = [10, 15, 20]
+输出: 15
+解释: 最低花费是从cost[1]开始，然后走两步即可到阶梯顶，一共花费15。
+ 示例 2:
+
+输入: cost = [1, 100, 1, 1, 1, 100, 1, 1, 100, 1]
+输出: 6
+解释: 最低花费方式是从cost[0]开始，逐个经过那些1，跳过cost[3]，一共花费6。
+注意：
+
+cost 的长度将会在 [2, 1000]。
+每一个 cost[i] 将会是一个Integer类型，范围为 [0, 999]。
+"""
+from typing import List
+
+
+def minCostClimbingStairs(cost: List[int]) -> int:
+
+    # val_list = []
+    # for start1 in range(2):
+    #     start1_score = 0
+    #     start1_score += cost[start1]
+    #     while start1 < len(cost)-1:
+    #         tmp = cost[start1+1: start1+3]
+    #         print(tmp)
+    #         print(start1_score)
+    #         if len(tmp) > 1:
+    #             if tmp[0] == tmp[1]:
+    #                 start1 += 2
+    #                 start1_score += tmp[1]
+    #             else:
+    #                 min_cost = min(tmp)
+    #                 start1 += tmp.index(min_cost)+1
+    #                 start1_score += min_cost
+    #         if len(tmp) == 1:
+    #             start1 += 1
+    #             # start1_score += tmp[0]
+    #         if len(tmp) == 0:
+    #             break
+    #     val_list.append(start1_score)
+    # return min(val_list)
+
+    dp0, dp1 = cost[0], cost[1]
+
+    for i in range(2, len(cost)):
+        dpi = min(dp0 + cost[i], dp1 + cost[i])
+        dp0, dp1 = dp1, dpi
+
+    return min(dp0, dp1)
+
+    # start2 = 1
+    # start2_score = 0
+    # start2_score += cost[start2]
+    # while start2 < len(cost):
+    #     tmp = cost[start2+1: start2+3]
+    #     if len(tmp) == 0:
+    #         break
+    #     min_cost = min(tmp)
+    #     start2 += tmp.index(min_cost)+1
+    #     start2_score += min_cost
+    # # print(start2_score)
+    # return start1_score
+
+
+# data = [1, 100, 1, 1, 1, 100, 1, 1, 100, 1]
+data = [0, 1, 2, 2]
+n = minCostClimbingStairs(data)
+print(n)
diff --git a/leetcode/_00887_super_egg_drop.py → Leetcode/_00887_super_egg_drop.py b/leetcode/_00887_super_egg_drop.py → Leetcode/_00887_super_egg_drop.py
diff --git a/...code/binary_search/divide_two_integers.py → ...code/binary_search/divide_two_integers.py b/...code/binary_search/divide_two_integers.py → ...code/binary_search/divide_two_integers.py
diff --git a/.../greedy_algorithm/00392_is_subsequence.py → .../greedy_algorithm/00392_is_subsequence.py b/.../greedy_algorithm/00392_is_subsequence.py → .../greedy_algorithm/00392_is_subsequence.py
diff --git a/.../greedy_algorithm/00455_assign_cookies.py → .../greedy_algorithm/00455_assign_cookies.py b/.../greedy_algorithm/00455_assign_cookies.py → .../greedy_algorithm/00455_assign_cookies.py
diff --git a/...greedy_algorithm/00860_lemonade_change.py → ...greedy_algorithm/00860_lemonade_change.py b/...greedy_algorithm/00860_lemonade_change.py → ...greedy_algorithm/00860_lemonade_change.py
diff --git a/...dy_algorithm/01029_two_city_scheduling.py → ...dy_algorithm/01029_two_city_scheduling.py b/...dy_algorithm/01029_two_city_scheduling.py → ...dy_algorithm/01029_two_city_scheduling.py
diff --git a/...122_best_time_to_buy_and_sell_stock_ii.py → ...122_best_time_to_buy_and_sell_stock_ii.py b/...122_best_time_to_buy_and_sell_stock_ii.py → ...122_best_time_to_buy_and_sell_stock_ii.py
diff --git a/leetcode/greedy_algorithm/test.py → Leetcode/greedy_algorithm/test.py b/leetcode/greedy_algorithm/test.py → Leetcode/greedy_algorithm/test.py
diff --git a/leetcode/readme.md → Leetcode/readme.md b/leetcode/readme.md → Leetcode/readme.md
diff --git a/leetcode/recursion/000726_number_of_atoms.py → Leetcode/recursion/000726_number_of_atoms.py b/leetcode/recursion/000726_number_of_atoms.py → Leetcode/recursion/000726_number_of_atoms.py
diff --git a/...ecursion/00131_palindrome_partitioning.py → ...ecursion/00131_palindrome_partitioning.py b/...ecursion/00131_palindrome_partitioning.py → ...ecursion/00131_palindrome_partitioning.py
diff --git a/leetcode/stack/00155_min_stack.py → Leetcode/stack/00155_min_stack.py b/leetcode/stack/00155_min_stack.py → Leetcode/stack/00155_min_stack.py
diff --git a/...ack/00225_implement_stack_using_queues.py → ...ack/00225_implement_stack_using_queues.py b/...ack/00225_implement_stack_using_queues.py → ...ack/00225_implement_stack_using_queues.py
diff --git a/...ack/00232_implement_queue_using_stacks.py → ...ack/00232_implement_queue_using_stacks.py b/...ack/00232_implement_queue_using_stacks.py → ...ack/00232_implement_queue_using_stacks.py
diff --git a/leetcode/stack/00242_valid_anagram.py → Leetcode/stack/00242_valid_anagram.py b/leetcode/stack/00242_valid_anagram.py → Leetcode/stack/00242_valid_anagram.py
diff --git a/...ode/stack/00469_next_greater_element_i.py → ...ode/stack/00469_next_greater_element_i.py b/...ode/stack/00469_next_greater_element_i.py → ...ode/stack/00469_next_greater_element_i.py
diff --git a/leetcode/stack/_00882_baseball_game.py → Leetcode/stack/_00882_baseball_game.py b/leetcode/stack/_00882_baseball_game.py → Leetcode/stack/_00882_baseball_game.py
diff --git a/fluent_python/chapter1/play_card.py → Python/Fluent_Python/chapter1/play_card.py b/fluent_python/chapter1/play_card.py → Python/Fluent_Python/chapter1/play_card.py
diff --git a/fluent_python/chapter1/tuple_unpack.py → ...on/Fluent_Python/chapter1/tuple_unpack.py b/fluent_python/chapter1/tuple_unpack.py → ...on/Fluent_Python/chapter1/tuple_unpack.py
diff --git a/fluent_python/chapter1/vector.py → Python/Fluent_Python/chapter1/vector.py b/fluent_python/chapter1/vector.py → Python/Fluent_Python/chapter1/vector.py
diff --git a/fluent_python/chapter2/array_example.py → ...n/Fluent_Python/chapter2/array_example.py b/fluent_python/chapter2/array_example.py → ...n/Fluent_Python/chapter2/array_example.py
diff --git a/fluent_python/chapter2/bisect.py → Python/Fluent_Python/chapter2/bisect.py b/fluent_python/chapter2/bisect.py → Python/Fluent_Python/chapter2/bisect.py
diff --git a/Python/Fluent_Python/chapter2/floats.bin b/Python/Fluent_Python/chapter2/floats.bin
diff --git a/fluent_python/chapter2/namedtuple.py → Python/Fluent_Python/chapter2/namedtuple.py b/fluent_python/chapter2/namedtuple.py → Python/Fluent_Python/chapter2/namedtuple.py
diff --git a/fluent_python/chapter6/strategy_mode.py → ...n/Fluent_Python/chapter6/strategy_mode.py b/fluent_python/chapter6/strategy_mode.py → ...n/Fluent_Python/chapter6/strategy_mode.py
diff --git a/python_basic_prctice/OOP/class_defination.py → Python/OOP/class_defination.py b/python_basic_prctice/OOP/class_defination.py → Python/OOP/class_defination.py
diff --git a/...on_basic_prctice/OOP/class_inheritance.py → Python/OOP/class_inheritance.py b/...on_basic_prctice/OOP/class_inheritance.py → Python/OOP/class_inheritance.py
diff --git a/python_basic_prctice/OOP/class_method.py → Python/OOP/class_method.py b/python_basic_prctice/OOP/class_method.py → Python/OOP/class_method.py
diff --git a/...n_basic_prctice/OOP/class_polymorphism.py → Python/OOP/class_polymorphism.py b/...n_basic_prctice/OOP/class_polymorphism.py → Python/OOP/class_polymorphism.py
diff --git a/python_basic_prctice/property_usage.py → Python/OOP/property_usage.py b/python_basic_prctice/property_usage.py → Python/OOP/property_usage.py
diff --git a/python_basic_prctice/OOP/readme.md → Python/OOP/readme.md b/python_basic_prctice/OOP/readme.md → Python/OOP/readme.md
diff --git a/leetcode/00131_palindrome_partitioning.py b/leetcode/00131_palindrome_partitioning.py
diff --git a/readme.md b/readme.md
@@ -1,5 +1,9 @@
 ### 值得反复学习的优秀项目或者代码
 
-#### sougou_spider 搜狗微信爬虫，新的requests的使用方式、3.7的语法、高级的代码表达方式, lxml 新的解析函数
+#### Algorithm 算法： 目前已完成常见排序算法
+#### Data Structure 数据结构： 目前已完成链表，队列，接下来学习树
+#### Excellent Cases： 优秀的项目学习 目前有一个sougou爬虫的例子
+#### LeetCode： 刷题记录
+#### Python： Python基础练习
 
-#### LeetCode刷题，每天一个
+Date：2019-07-05