Refactor

include/offer_05.hpp

@@ -5,7 +5,7 @@
 
 using namespace std;
 
-class Solution {
+class Offer05 {
  public:
   string replaceSpace(string s);
 };

include/offer_58.hpp

@@ -5,7 +5,7 @@
 
 using namespace std;
 
-class Solution {
+class Offer58 {
  public:
   string reverseLeftWords(string s, int n);
   void reverseSubStr(string &s, int begin, int end);

include/s0001_two_sum.hpp

@@ -5,7 +5,9 @@
 #include <unordered_map>
 #include <vector>
 
-class Solution {
+using namespace std;
+
+class S0001 {
  public:
   /**
    * @brief Two Sum

include/s0002_add_two_numbers.hpp

@@ -9,7 +9,7 @@ struct ListNode {
   ListNode(int x, ListNode* next) : val(x), next(next) {}
 };
 
-class Solution {
+class S0002 {
  public:
   /**
    * @brief Add Two Numbers

include/s0003_longest_substring_without_repeating_characters.hpp

@@ -4,7 +4,9 @@
 #include <map>
 #include <string>
 
-class Solution {
+using namespace std;
+
+class S0003 {
  public:
   /**
    * @brief Longest Substring Without Repeating Characters

include/s0004_median_of_two_sorted_arrays.hpp

@@ -3,7 +3,9 @@
 
 #include <vector>
 
-class Solution {
+using namespace std;
+
+class S0004 {
  public:
   /**
    * @brief Median of Two Sorted Arrays

include/s0005_longest_palindromic_substring.hpp

@@ -1,26 +1,20 @@
 #ifndef S0005_LONGEST_PALINDROMIC_SUBSTRING_HPP
 #define S0005_LONGEST_PALINDROMIC_SUBSTRING_HPP
 
-#include <string>
 #include <algorithm>
+#include <string>
 #include <vector>
 
 using namespace std;
 
-class Solution1 {
- public:
-  /**
-   * @brief Longest Palindromic Substring
-   *
-   * Given a string s, return the longest palindromic substring in s.
-   *
-   * @param s the given string
-   * @return longest palindromic substring
-   */
-  string longestPalindrome(string s);
-};
+typedef struct S0005ResultStruct {
+  int left1;  // 边界情况为长度为 1 的字符时，扩展完成后的左边界
+  int right1;  // 边界情况为长度为 1 的字符时，扩展完成后的右边界
+  int left2;  // 边界情况为长度为 2 的字符串时，扩展完成后的左边界
+  int right2;  // 边界情况为长度为 2 的字符串时，扩展完成后的右边界
+} S0005Result;
 
-class Solution2 {
+class S0005 {
  public:
   /**
    * @brief Longest Palindromic Substring
@@ -30,7 +24,17 @@ class Solution2 {
    * @param s the given string
    * @return longest palindromic substring
    */
-  string longestPalindrome(string s);
+  string longestPalindrome1(string s);
+  /**
+   * @brief Longest Palindromic Substring
+   *
+   * Given a string s, return the longest palindromic substring in s.
+   *
+   * @param s the given string
+   * @return longest palindromic substring
+   */
+  string longestPalindrome2(string s);
+  S0005Result expand(string s, int i);
 };
 
 #endif

include/s0006_zigzag_conversion.hpp

@@ -5,7 +5,7 @@
 
 using namespace std;
 
-class Solution {
+class S0006 {
  public:
   /**
    * @brief Zigzag Conversion

include/s0007_reverse_integer.hpp

@@ -5,7 +5,9 @@
 #include <cmath>
 #include <climits>
 
-class Solution {
+using namespace std;
+
+class S0007 {
 public:
     int reverse(int x);
 };

include/s0008_string_to_integer.hpp

@@ -8,7 +8,7 @@
 
 using namespace std;
 
-class Solution {
+class S0008 {
 public:
     int myAtoi(string s);
 };

include/s0009_palindrome_number.hpp

@@ -6,7 +6,7 @@
 
 using namespace std;
 
-class Solution {
+class S0009 {
  public:
   bool isPalindrome(int x);
 };

include/s0010_regular_expression_matching.hpp

@@ -6,7 +6,7 @@
 
 using namespace std;
 
-class Solution {
+class S0010 {
  public:
   bool isMatch(string s, string p);
 };

include/s0011_container_with_most_water.hpp

@@ -5,7 +5,7 @@
 
 using namespace std;
 
-class Solution {
+class S0011 {
  public:
   int maxArea(vector<int>& height);
 };

include/s0012_integer_to_roman.hpp

@@ -5,7 +5,7 @@
 
 using namespace std;
 
-class Solution {
+class S0012 {
  public:
   string intToRoman(int num);
 };

include/s0013_roman_to_integer.hpp

@@ -6,7 +6,7 @@
 
 using namespace std;
 
-class Solution {
+class S0013 {
  public:
   int romanToInt(string s);
 };

include/s0014_longest_common_prefix.hpp

@@ -6,7 +6,7 @@
 
 using namespace std;
 
-class Solution {
+class S0014 {
  public:
   string longestCommonPrefix(vector<string>& strs);
 };

include/s0015_3sum.hpp

@@ -7,14 +7,10 @@
 
 using namespace std;
 
-class Solution1 {
+class S0015 {
  public:
-  vector<vector<int>> threeSum(vector<int>& nums);
-};
-
-class Solution2 {
- public:
-  vector<vector<int>> threeSum(vector<int>& nums);
+  vector<vector<int>> threeSum1(vector<int>& nums);
+  vector<vector<int>> threeSum2(vector<int>& nums);
 };
 
 #endif

include/s0016_3sum_closest.hpp

@@ -6,7 +6,7 @@
 
 using namespace std;
 
-class Solution {
+class S0016 {
  public:
   int threeSumClosest(vector<int>& nums, int target);
 };

include/s0017_letter_combinations_of_a_phone_number.hpp

@@ -7,7 +7,7 @@
 
 using namespace std;
 
-class Solution {
+class S0017 {
  public:
   vector<string> letterCombinations(string digits);
 };

include/s0018_4sum.hpp

@@ -6,7 +6,7 @@
 
 using namespace std;
 
-class Solution {
+class S0018 {
  public:
   vector<vector<int>> fourSum(vector<int>& nums, int target);
 };

include/s0019_remove_nth_node_from_end_of_list.hpp

@@ -9,7 +9,7 @@ struct ListNode {
   ListNode(int x, ListNode* next) : val(x), next(next) {}
 };
 
-class Solution {
+class S0019 {
  public:
   ListNode* removeNthFromEnd(ListNode* head, int n);
 };

include/s0020_valid_parentheses.hpp

@@ -6,9 +6,10 @@
 
 using namespace std;
 
-class Solution {
+class S0020 {
  public:
   bool isValid(string s);
+  bool match(string s1, string s2);
 };
 
 #endif

include/s0021_merge_two_sorted_lists.hpp

@@ -1,6 +1,10 @@
 #ifndef S0021_MERGE_TWO_SORTED_LISTS_HPP
 #define S0021_MERGE_TWO_SORTED_LISTS_HPP
 
+#include <limits>
+
+using namespace std;
+
 struct ListNode {
   int val;
   ListNode* next;
@@ -9,9 +13,7 @@ struct ListNode {
   ListNode(int x, ListNode* next) : val(x), next(next) {}
 };
 
-#include <limits>
-
-class Solution {
+class S0021 {
  public:
   ListNode* mergeTwoLists(ListNode* list1, ListNode* list2);
 };

include/s0022_generate_parentheses.hpp

@@ -7,9 +7,10 @@
 
 using namespace std;
 
-class Solution {
+class S0022 {
  public:
   vector<string> generateParenthesis(int n);
+  void dfs(string current, int left, int right, vector<string> &result);
 };
 
 #endif

include/s0023_merge_k_sorted_lists.hpp

@@ -7,15 +7,17 @@ using namespace std;
 
 struct ListNode {
   int val;
-  ListNode* next;
+  ListNode *next;
   ListNode() : val(0), next(nullptr) {}
   ListNode(int x) : val(x), next(nullptr) {}
-  ListNode(int x, ListNode* next) : val(x), next(next) {}
+  ListNode(int x, ListNode *next) : val(x), next(next) {}
 };
 
-class Solution {
+class S0023 {
  public:
-  ListNode* mergeKLists(vector<ListNode*>& lists);
+  ListNode *mergeKLists(vector<ListNode *> &lists);
+  ListNode *mergeTwoLists(ListNode *a, ListNode *b);
+  ListNode *merge(vector<ListNode *> &lists, int l, int r);
 };
 
 #endif

include/s0024_swap_nodes_in_pairs.hpp

@@ -9,7 +9,7 @@ struct ListNode {
   ListNode(int x, ListNode* next) : val(x), next(next) {}
 };
 
-class Solution {
+class S0024 {
  public:
   ListNode* swapPairs(ListNode* head);
 };

include/s0025_reverse_nodes_in_k-group.hpp

@@ -1,8 +1,8 @@
 #ifndef S0025_REVERSE_NODES_IN_K_GROUP_HPP
 #define S0025_REVERSE_NODES_IN_K_GROUP_HPP
 
-#include <utility>
 #include <tuple>
+#include <utility>
 
 using namespace std;
 
@@ -14,9 +14,10 @@ struct ListNode {
   ListNode(int x, ListNode* next) : val(x), next(next) {}
 };
 
-class Solution {
+class S0025 {
  public:
   ListNode* reverseKGroup(ListNode* head, int k);
+  pair<ListNode*, ListNode*> myReverse(ListNode* head, ListNode* tail);
 };
 
 #endif

include/s0026_remove_duplicates_from_sorted_array.hpp

@@ -5,7 +5,7 @@
 
 using namespace std;
 
-class Solution {
+class S0026 {
  public:
   int removeDuplicates(vector<int>& nums);
 };

include/s0027_remove_element.hpp

@@ -5,7 +5,7 @@
 
 using namespace std;
 
-class Solution {
+class S0027 {
  public:
   int removeElement(vector<int>& nums, int val);
 };

include/s0028_find_the_index_of_the_first_occurrence_in_a_string.hpp

@@ -5,7 +5,7 @@
 
 using namespace std;
 
-class Solution {
+class S0028 {
  public:
   int strStr(string haystack, string needle);
 };

include/s0029_divide_two_integers.hpp

@@ -3,9 +3,12 @@
 
 #include <climits>
 
-class Solution {
+using namespace std;
+
+class S0029 {
  public:
   int divide(int dividend, int divisor);
+  int div(long a, long b);
 };
 
 #endif

include/s0030_substring_with_concatenation_of_all_words.hpp

@@ -7,7 +7,7 @@
 
 using namespace std;
 
-class Solution {
+class S0030 {
  public:
   vector<int> findSubstring(string s, vector<string>& words);
 };

include/s0031_next_permutation.hpp

@@ -6,7 +6,7 @@
 
 using namespace std;
 
-class Solution {
+class S0031 {
  public:
   void nextPermutation(vector<int>& nums);
 };

include/s0032_longest_valid_parentheses.hpp

@@ -7,7 +7,7 @@
 
 using namespace std;
 
-class Solution {
+class S0032 {
  public:
   int longestValidParentheses(string s);
 };

include/s0033_search_in_rotated_sorted_array.hpp

@@ -6,7 +6,7 @@
 
 using namespace std;
 
-class Solution {
+class S0033 {
  public:
   int search(vector<int>& nums, int target);
 };

include/s0034_find_first_and_last_position_of_element_in_sorted_array.hpp

@@ -5,13 +5,10 @@
 
 using namespace std;
 
-class Solution1 {
+class S0034 {
  public:
-  vector<int> searchRange(vector<int>& nums, int target);
+  vector<int> searchRange1(vector<int>& nums, int target);
+  vector<int> searchRange2(vector<int>& nums, int target);
 };
 
-class Solution2 {
- public:
-  vector<int> searchRange(vector<int>& nums, int target);
-};
 #endif

include/s0035_search_insert_position.hpp

@@ -5,14 +5,10 @@
 
 using namespace std;
 
-class Solution1 {
+class S0035 {
  public:
-  int searchInsert(vector<int>& nums, int target);
-};
-
-class Solution2 {
- public:
-  int searchInsert(vector<int>& nums, int target);
+  int searchInsert1(vector<int>& nums, int target);
+  int searchInsert2(vector<int>& nums, int target);
 };
 
 #endif

include/s0036_valid_sudoku.hpp

@@ -7,7 +7,7 @@
 
 using namespace std;
 
-class Solution {
+class S0036 {
  public:
   bool isValidSudoku(vector<vector<char>>& board);
 };

include/s0037_sudoku_solver.hpp

@@ -1,16 +1,21 @@
 #ifndef S0037_SUDOKU_SOLVER_HPP
 #define S0037_SUDOKU_SOLVER_HPP
 
-#include <vector>
-#include <unordered_map>
-#include <cmath>
 #include <algorithm>
+#include <cmath>
+#include <unordered_map>
+#include <vector>
 
 using namespace std;
 
-class Solution {
+class S0037 {
  public:
-  void solveSudoku(vector<vector<char>>& board);
+  void solveSudoku(vector<vector<char>> &board);
+  bool recusiveSolveSudoku(vector<vector<char>> &board,
+                           vector<unordered_map<char, bool>> &rows,
+                           vector<unordered_map<char, bool>> &cols,
+                           vector<unordered_map<char, bool>> &grids, int row,
+                           int col);
 };
 
 #endif

include/s0038_count_and_say.hpp

@@ -6,7 +6,7 @@
 
 using namespace std;
 
-class Solution {
+class S0038 {
  public:
   string countAndSay(int n);
 };

include/s0039_combination_sum.hpp

@@ -1,15 +1,17 @@
 #ifndef S0039_COMBINATION_SUM_HPP
 #define S0039_COMBINATION_SUM_HPP
 
-#include <vector>
 #include <algorithm>
 #include <iterator>
+#include <vector>
 
 using namespace std;
 
-class Solution {
+class S0039 {
  public:
   vector<vector<int>> combinationSum(vector<int>& candidates, int target);
+  void dfs(vector<int>& candidates, int target, vector<vector<int>>& ans,
+           vector<int>& combine, int idx);
 };
 
 #endif

include/s0076_minimum_window_substring.hpp

@@ -7,7 +7,7 @@
 
 using namespace std;
 
-class Solution {
+class S0076 {
  public:
   string minWindow(string s, string t);
   unordered_map<char, int> ori, cnt;

include/s0151_reverse_words_in_a_string.hpp

@@ -5,7 +5,7 @@
 
 using namespace std;
 
-class Solution {
+class S0151 {
  public:
   void reverseSubStr(string &s, int begin, int end);
   string reverseWords(string s);

include/s0209_minimum_size_subarray_sum.hpp

@@ -6,7 +6,7 @@
 
 using namespace std;
 
-class Solution {
+class S0209 {
  public:
   int minSubArrayLen(int target, vector<int>& nums);
 };

include/s0283_move_zeroes.hpp

@@ -5,7 +5,7 @@
 
 using namespace std;
 
-class Solution {
+class S0283 {
  public:
   void moveZeroes(vector<int>& nums);
 };

include/s0704_binary_search.hpp

@@ -5,14 +5,10 @@
 
 using namespace std;
 
-class Solution1 {
+class S0704 {
  public:
-  int binSearch(vector<int>& nums, int target);
-};
-
-class Solution2 {
- public:
-  int binSearch(vector<int>& nums, int target);
+  int binSearch1(vector<int>& nums, int target);
+  int binSearch2(vector<int>& nums, int target);
 };
 
 #endif