diff --git a/35. Search Insert Position.md b/35. Search Insert Position.md
new file mode 100644
index 0000000..f0bcabb
--- /dev/null
+++ b/35. Search Insert Position.md	
@@ -0,0 +1,16 @@
+# [Search Insert Position](https://leetcode.com/problems/remove-element/description/)
+# 思路
+排序数组查找肯定就是二分法啦，但是题目没说一定是增序，根据结果来看应该全是增序。
+# C++
+```
+class Solution {
+public:
+    int removeElement(vector<int>& nums, int val) {
+        int count = 0;
+        for(int i = 0; i < nums.size(); i++){
+            if(nums[i] != val) nums[count++] = nums[i]; 
+        }
+        return count;
+    }
+};
+```