Bin search

include/s0034_find_first_and_last_position_of_element_in_sorted_array.hpp

@@ -2,13 +2,16 @@
 #define S0034_FIND_FIRST_AND_LAST_POSITION_OF_ELEMENT_IN_SORTED_ARRAY_HPP
 
 #include <vector>
-#include <cmath>
 
 using namespace std;
 
-class Solution {
+class Solution1 {
  public:
   vector<int> searchRange(vector<int>& nums, int target);
 };
 
+class Solution2 {
+ public:
+  vector<int> searchRange(vector<int>& nums, int target);
+};
 #endif

include/s0035_search_insert_position.hpp

@@ -2,11 +2,15 @@
 #define S0035_SEARCH_INSERT_POSITION_HPP
 
 #include <vector>
-#include <cmath>
 
 using namespace std;
 
-class Solution {
+class Solution1 {
+ public:
+  int searchInsert(vector<int>& nums, int target);
+};
+
+class Solution2 {
  public:
   int searchInsert(vector<int>& nums, int target);
 };

include/s0704_binary_search.hpp

@@ -0,0 +1,18 @@
+#ifndef S0704_BINARY_SEARCH_HPP
+#define S0704_BINARY_SEARCH_HPP
+
+#include <vector>
+
+using namespace std;
+
+class Solution1 {
+ public:
+  int binSearch(vector<int>& nums, int target);
+};
+
+class Solution2 {
+ public:
+  int binSearch(vector<int>& nums, int target);
+};
+
+#endif