refactor: 移动已完成的题目

src/problem/mod.rs

@@ -0,0 +1,17 @@
+mod p0001_two_sum;
+mod p0009_palindrome_number;
+mod p0020_valid_parentheses;
+mod p2697_lexicographically_smallest_palindrome;
+mod p0002_add_two_numbers;
+mod p0003_longest_substring_without_repeating_characters;
+mod p0162_find_peak_element;
+mod p2828_check_if_a_string_is_an_acronym_of_words;
+mod p0052_n_queens_ii;
+mod p0912_sort_an_array;
+mod p1276_number_of_burgers_with_no_waste_of_ingredients;
+mod p0006_zigzag_conversion;
+mod p0007_reverse_integer;
+mod p0004_median_of_two_sorted_arrays;
+mod p0743_network_delay_time;
+mod p0447_number_of_boomerangs;
+mod p2085_count_common_words_with_one_occurrence;

src/solution/mod.rs

@@ -1,17 +0,0 @@
-mod s0001_two_sum;
-mod s0009_palindrome_number;
-mod s0020_valid_parentheses;
-mod s2697_lexicographically_smallest_palindrome;
-mod s0002_add_two_numbers;
-mod s0003_longest_substring_without_repeating_characters;
-mod s0162_find_peak_element;
-mod s2828_check_if_a_string_is_an_acronym_of_words;
-mod s0052_n_queens_ii;
-mod s0912_sort_an_array;
-mod s1276_number_of_burgers_with_no_waste_of_ingredients;
-mod s0006_zigzag_conversion;
-mod s0007_reverse_integer;
-mod s0004_median_of_two_sorted_arrays;
-mod s0743_network_delay_time;
-mod s0447_number_of_boomerangs;
-mod s2085_count_common_words_with_one_occurrence;

template.rs

@@ -1,12 +1,8 @@
 /**
  * [__PROBLEM_ID__] __PROBLEM_TITLE__
- *
- * __PROBLEM_DESC__
  */
-pub struct Solution {}__EXTRA_USE__
+pub struct Solution {}
-
+__EXTRA_USE__
-// problem: __PROBLEM_LINK__
-// discuss: __DISCUSS_LINK__
 
 // submission codes start here