diff --git a/src/s0037_sudoku_solver.cpp b/src/s0037_sudoku_solver.cpp
index e010dbf..00c133b 100644
--- a/src/s0037_sudoku_solver.cpp
+++ b/src/s0037_sudoku_solver.cpp
@@ -1,8 +1,5 @@
 #include "s0037_sudoku_solver.hpp"
 
-#include <unordered_map>
-#include <vector>
-
 // 返回结果为当前传递进去的数独是否存在解
 bool recusiveSolveSudoku(vector<vector<char>> &board,
                          vector<unordered_map<char, bool>> &rows,
diff --git a/src/s0039_combination_sum.cpp b/src/s0039_combination_sum.cpp
index 52907b5..37407ec 100644
--- a/src/s0039_combination_sum.cpp
+++ b/src/s0039_combination_sum.cpp
@@ -1,7 +1,5 @@
 #include "s0039_combination_sum.hpp"
 
-#include <vector>
-
 void dfs(vector<int>& candidates, int target, vector<vector<int>>& ans,
          vector<int>& combine, int idx) {
   if (idx == candidates.size()) {