add 35

Author: luliyucoordinate

README.md

@@ -28,6 +28,7 @@ LeetCode
 |0024|[Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/) | c | [c++](./src/0445-Add-Two-Numbers-II/0024.cpp) |[python](./src/0445-Add-Two-Numbers-II/0024.py)|||Medium|
 |0026|[Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/) | c | [c++](./src/0026-Remove-Duplicates-from-Sorted-Array/0026.cpp) |[python](./src/0026-Remove-Duplicates-from-Sorted-Array/0026.py)|||Easy|
 |0027|[Remove Element](https://leetcode.com/problems/remove-element/) | c | [c++](./src/0027-Remove-Element/0027.cpp) |[python](./src/0027-Remove-Element/0027.py)|||Easy|
+|0035|[Search Insert Position](https://leetcode.com/problems/search-insert-position/) | c | [c++](./src/0035-Search-Insert-Position/0027.cpp) |[python](./src/0035-Search-Insert-Position/0027.py)|||Easy|
 |0039|[Combination Sum](https://leetcode.com/problems/combination-sum/) | c | [c++](./src/0039-Combination-Sum/0039.cpp) |[python](./src/0039-Combination-Sum/0039.py)|||Medium|
 |0040|[Combination Sum II](https://leetcode.com/problems/combination-sum-ii/) | c | [c++](./src/0040-Combination-Sum-II/0040.cpp) |[python](./src/0040-Combination-Sum-II/0040.py)|||Medium|
 |0046|[Permutations](https://leetcode.com/problems/permutations/) | c | [c++](./src/0046-Permutations/0046.cpp) |[python](./src/0046-Permutations/0046.py)|||Medium|

src/0035-Search-Insert-Position/0035.cpp

@@ -0,0 +1,27 @@
+#include <iostream>
+#include <vector>
+using namespace std;
+
+static int x = [](){std::ios::sync_with_stdio(false);cin.tie(0);return 0;}();
+class Solution 
+{
+public:
+    int searchInsert(vector<int>& nums, int target) 
+    {
+        int l = 0, r = nums.size();
+        while (l < r)
+        {
+            int mid = (r - l)/2 + l;
+            if (target > nums[mid]) l = mid + 1;
+            else r = mid;
+        }
+        return l;
+    }
+};
+int main()
+{
+    vector<int> nums = {1, 3, 5, 6};
+    int target = 0;
+    cout << Solution().searchInsert(nums, target);
+    return 0;
+}

src/0035-Search-Insert-Position/0035.py

@@ -0,0 +1,22 @@
+class Solution:
+    def searchInsert(self, nums, target):
+        """
+        :type nums: List[int]
+        :type target: int
+        :rtype: int
+        """
+        l, r = 0, len(nums)
+        
+        while l < r:
+            mid = (r + l)//2
+            if target > nums[mid]:
+                l = mid + 1
+            else:
+                r = mid
+
+        return l
+
+if __name__ == "__main__":
+    nums = [1, 3, 5, 6]
+    target = 5
+    print(Solution().searchInsert(nums, target))