fix 03-firstlast_recursion.cpp in T038

Author: Flcwl

038-数字在排序数组中出现的次数/01-bruteforce.cpp

@@ -6,7 +6,7 @@ using namespace std;
 
 
 
-//  µ÷ÊÔ¿ª¹Ø
+//  调试开关
 #define __tmain main
 
 #ifdef __tmain

038-数字在排序数组中出现的次数/03-firstlast_recursion.cpp

@@ -14,7 +14,7 @@ using namespace std;
 
 #define debug 0 && cout
 
-#highif // __tmain
+#endif // __tmain
 
 class Solution
 {
@@ -33,13 +33,13 @@ class Solution
 
         if(first > -1 && last > -1)
         {
-            number = last - first +1;
-            return number;
+            number = last - first + 1;
         }
+        return number;
     }
 
     /*  查找第一个的位置  */
-    int GetFirstIndex(vector<int> &data, int low, int high, int k)
+    int GetFirstIndex(vector<int> &data, int k, int low, int high)
     {
         if(low > high)
         {
@@ -71,7 +71,7 @@ class Solution
         return GetFirstIndex(data, k, low, high);
     }
 
-    int GetLastIndex(vector<int> &data, int low, int high, int k)
+    int GetLastIndex(vector<int> &data, int k, int low, int high)
     {
         if(low > high)
         {
@@ -81,28 +81,28 @@ class Solution
         int mid = (low + high) / 2;
         if(data[mid]==k)
         {
-            if((mid>0 && data[mid+1] !=k) || mid == high)
+            if((mid < high && data[mid+1] != k) || mid == high)
             {
                 return mid;
             }
             else
             {
-                low = mid +1;
+                low = mid + 1;
             }
         }
         else
         {
-            if(mid>k)
+            if(mid > k)
             {
-                high = mid-1;
+                high = mid - 1;
             }
             else
             {
-                low = mid+1;
+                low = mid + 1;
             }
         }
 
-        return GetLastIndex(data,k,low,high);
+        return GetLastIndex(data, k, low, high);
     }
 };
 
@@ -114,7 +114,7 @@ int __tmain( )
 
     int arr[] = { 1, 2, 3, 3, 3, 3, 4, 5 };
     vector<int> vec(arr, arr + 8);
-    cout <<solu.GetNumberOfK(vec, 5) <<highl;
+    cout <<solu.GetNumberOfK(vec, 5) <<endl;
 
     return 0;
 }

038-数字在排序数组中出现的次数/03-firstlast_stlbound.cpp

@@ -25,7 +25,7 @@ class Solution
 public:
     int GetNumberOfK(vector<int> data ,int k)
     {
-        int upper = upper_bound(data.begin(),data.end(),k)£»
+        int upper = upper_bound(data.begin(),data.end(),k);
         int low = lower_bound(data.begin(),data.end(),k);
         return upper - low;
     }

038-数字在排序数组中出现的次数/04-multiset.cpp

@@ -7,7 +7,7 @@ using namespace std;
 
 
 
-//  µ÷ÊÔ¿ª¹Ø
+//  调试开关
 #define __tmain main
 
 #ifdef __tmain

038-数字在排序数组中出现的次数/README.md

@@ -235,13 +235,13 @@ public:
 
         if(first > -1 && last > -1)
         {
-            number = last - first +1;
-            return number;
+            number = last - first + 1;
         }
+        return number;
     }
 
     // 查找第一个的位置
-    int GetFirstIndex(vector<int> &data, int low, int high, int k)
+    int GetFirstIndex(vector<int> &data, int k, int low, int high)
     {
         if(low > high)
         {
@@ -273,7 +273,7 @@ public:
         return GetFirstIndex(data, k, low, high);
     }
 
-    int GetLastIndex(vector<int> &data, int low, int high, int k)
+    int GetLastIndex(vector<int> &data, int k, int low, int high)
     {
         if(low > high)
         {
@@ -283,28 +283,28 @@ public:
         int mid = (low + high) / 2;
         if(data[mid]==k)
         {
-            if((mid>0 && data[mid+1] !=k) || mid == high)
+            if((mid < high && data[mid+1] != k) || mid == high)
             {
                 return mid;
             }
             else
             {
-                low = mid +1;
+                low = mid + 1;
             }
         }
         else
         {
             if(mid>k)
             {
-                high = mid-1;
+                high = mid - 1;
             }
             else
             {
-                low = mid+1;
+                low = mid + 1;
             }
         }
 
-        return GetLastIndex(data,k,low,high);
+        return GetLastIndex(data, k, low, high);
     }
 };
 ```