35

Author: LuYanFCP

README.md

@@ -90,6 +90,7 @@ Leetcode刷题记录
 
 ## 二分
 
++ No.32 [cpp](cpp/35.cpp)
 + No.50 快速幂 [cpp](cpp/50.cpp) [python](python/50.py)
 + No.128 [cpp](cpp/128.cpp) [python](python/128.py)
 + No.1300 [cpp](cpp/1300.cpp) [python](python/1300.py)

cpp/35.cpp

@@ -0,0 +1,19 @@
+class Solution {
+public:
+    int searchInsert(vector<int>& nums, int target) {
+        int n = nums.size();
+        int i = 0, j = n-1, mid;
+        while(i < j) {
+            mid = (j - i) / 2 + i;
+            if (nums[mid] < target) {
+                i = mid +　1;
+            } else if (nums [mid] > target) {
+                j = mid;
+            } else {
+                return mid;
+            }
+        }
+        if (nums[i] < target) i++;
+        return i;
+    }
+};