From aceaed72c86282b4e520ec1b119b127f0cf8859b Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E5=94=90=E6=A0=91=E6=A3=AE?= <14021051@buaa.edu.cn>
Date: Sat, 1 Sep 2018 19:07:16 +0800
Subject: [PATCH] Create 35. Search Insert Position.md

---
 35. Search Insert Position.md | 16 ++++++++++++++++
 1 file changed, 16 insertions(+)
 create mode 100644 35. Search Insert Position.md

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;
+    }
+};
+```