Update solution 035 [Java]

Author: yanglbme

README.md

@@ -27,6 +27,7 @@ Complete [solutions](https://github.com/doocs/leetcode/tree/master/solution) to
 | 020 | [Valid Parentheses](https://github.com/doocs/leetcode/tree/master/solution/020.Valid%20Parentheses) | `String`, `Stack` |
 | 021 | [Merge Two Sorted Lists](https://github.com/doocs/leetcode/tree/master/solution/021.Merge%20Two%20Sorted%20Lists) | `Linked List` |
 | 028 | [Implement strStr()](https://github.com/doocs/leetcode/tree/master/solution/028.Implement%20strStr()) | `Two Pointers`, `String` |
+| 035 | [Search Insert Position](https://github.com/doocs/leetcode/tree/master/solution/035.Search%20Insert%20Position) | `Array`, `Binary Search` |
 | 053 | [Maximum Subarray](https://github.com/doocs/leetcode/tree/master/solution/053.Maximum%20Subarray) | `Array`, `Divide and Conquer`, `Dynamic Programming` |
 | 070 | [Climbing Stairs](https://github.com/doocs/leetcode/tree/master/solution/070.Climbing%20Stairs) | `Dynamic Programming` |
 | 083 | [Remove Duplicates from Sorted List](https://github.com/doocs/leetcode/tree/master/solution/083.Remove%20Duplicates%20from%20Sorted%20List) | `Linked List` |
@@ -100,7 +101,7 @@ I'm looking for long-term contributors/partners to this repo! Send me [PRs](http
 " If you want to go fast, go alone. If you want to go far, go together. And that's the spirit of [teamwork](https://github.com/doocs/leetcode/graphs/contributors) ".
 
 <!-- ALL-CONTRIBUTORS-LIST:START - Do not remove or modify this section -->
-| <center> [<img src="https://avatars3.githubusercontent.com/u/21008209?v=4" width="80px;"/>](https://github.com/yanglbme)<br />[💻](https://github.com/doocs/leetcode/commits?author=yanglbme "Code") </center> | <center> [<img src="https://avatars3.githubusercontent.com/u/23625436?v=4" width="80px;"/>](https://github.com/chakyam)<br />[💻](https://github.com/doocs/leetcode/commits?author=chakyam "Code") </center> | <center> [<img src="https://avatars3.githubusercontent.com/u/10081554?v=4" width="80px;"/>](https://github.com/zhkmxx9302013)<br />[💻](https://github.com/doocs/leetcode/commits?author=zhkmxx9302013 "Code") </center> | <center> [<img src="https://avatars3.githubusercontent.com/u/40383345?v=4" width="80px;"/>](https://github.com/MarkKuang1991)<br />[💻](https://github.com/doocs/leetcode/commits?author=MarkKuang1991 "Code") </center> | <center> [<img src="https://avatars3.githubusercontent.com/u/12371194?v=4" width="80px;"/>](https://github.com/fonxian)<br />[💻](https://github.com/doocs/leetcode/commits?author=fonxian "Code") </center> | <center> [<img src="https://avatars3.githubusercontent.com/u/25222367?v=4" width="80px;"/>](https://github.com/zhanary)<br />[💻](https://github.com/doocs/leetcode/commits?author=zhanary "Code") </center> | 
-|---|---|---|---|---|---|
+| <center> [<img src="https://avatars3.githubusercontent.com/u/21008209?v=4" width="80px;"/>](https://github.com/yanglbme)<br />[💻](https://github.com/doocs/leetcode/commits?author=yanglbme "Code") </center> | <center> [<img src="https://avatars3.githubusercontent.com/u/23625436?v=4" width="80px;"/>](https://github.com/chakyam)<br />[💻](https://github.com/doocs/leetcode/commits?author=chakyam "Code") </center> | <center> [<img src="https://avatars3.githubusercontent.com/u/10081554?v=4" width="80px;"/>](https://github.com/zhkmxx9302013)<br />[💻](https://github.com/doocs/leetcode/commits?author=zhkmxx9302013 "Code") </center> | <center> [<img src="https://avatars3.githubusercontent.com/u/40383345?v=4" width="80px;"/>](https://github.com/MarkKuang1991)<br />[💻](https://github.com/doocs/leetcode/commits?author=MarkKuang1991 "Code") </center> | <center> [<img src="https://avatars3.githubusercontent.com/u/12371194?v=4" width="80px;"/>](https://github.com/fonxian)<br />[💻](https://github.com/doocs/leetcode/commits?author=fonxian "Code") </center> | <center> [<img src="https://avatars3.githubusercontent.com/u/25222367?v=4" width="80px;"/>](https://github.com/zhanary)<br />[💻](https://github.com/doocs/leetcode/commits?author=zhanary "Code") </center> | <center> [<img src="https://avatars3.githubusercontent.com/u/42396616?v=4" width="80px;"/>](https://github.com/ZhouTingZhaobiu)<br />[💻](https://github.com/doocs/leetcode/commits?author=ZhouTingZhaobiu "Code") </center> | 
+|---|---|---|---|---|---|---|
 
 <!-- ALL-CONTRIBUTORS-LIST:END -->

solution/035.Search Insertion Location/README.md

@@ -6,55 +6,87 @@
 
 你可以假设数组中无重复元素。
 
-示例 1:
-
+**示例 1:**
+```
 输入: [1,3,5,6], 5
 输出: 2
-示例 2:
+```
 
+**示例 2:**
+```
 输入: [1,3,5,6], 2
 输出: 1
-示例 3:
+```
 
+**示例 3:**
+```
 输入: [1,3,5,6], 7
 输出: 4
-示例 4:
+```
 
+**示例 4:**
+```
 输入: [1,3,5,6], 0
 输出: 0
+```
 
 ### 解法
-首先判断传入的数组为0,1这样的长度
+首先判断传入的数组为 0,1 这样的长度。
 
 因为是一个给定的排序数组，在循环时就可以判断是否存在的同时判断大小，有相同的则直接返回索引，
-不存在则判断大小，只要相较于当前索引的元素较小，则可以认为该目标数在数组中无对应元素，直接返回索引即可
+不存在则判断大小，只要相较于当前索引的元素较小，则可以认为该目标数在数组中无对应元素，直接返回索引即可。
 
-除此之外还可用二分法做解
+除此之外还可用二分法做解。
 
 ```java
 class Solution {
     public int searchInsert(int[] nums, int target) {
-        if(nums.length == 0){
+        if(nums.length == 0) {
             return 0;
         }
-        if(nums.length == 1){
-            if(nums[0] < target){
+        if(nums.length == 1) {
+            if(nums[0] < target) {
                 return 1;
             } else {
                 return 0;
             }
         }
-        for(int i = 0;i < nums.length;i++){
-            if(nums[i] == target){
+        for(int i = 0;i < nums.length;i++) {
+            if(nums[i] == target) {
                 return i;
             } else {
                 int s = Math.min(nums[i],target);
-                if(s == target){
+                if(s == target) {
                     return i;
                 }
             }
         }
         return nums.length;
     }
 }
-```
+```
+
+- 二分法
+```java
+class Solution {
+    public int searchInsert(int[] nums, int target) {
+        if (nums == null || nums.length == 0) {
+            return 0;
+        }
+        int low = 0;
+        int high = nums.length - 1;
+        while (low <= high) {
+            int mid = low + ((high - low) >> 1);
+            if (nums[mid] == target) {
+                return mid;
+            }
+            if (nums[mid] < target) {
+                low = mid + 1;
+            } else {
+                high = mid - 1;
+            }
+        }
+        return low;
+    }
+}
+```

solution/035.Search Insertion Location/Solution.java

@@ -22,4 +22,30 @@ public int searchInsert(int[] nums, int target) {
         }
         return nums.length;
     }
-}
+}
+
+/*
+
+// 二分法 
+class Solution {
+    public int searchInsert(int[] nums, int target) {
+        if (nums == null || nums.length == 0) {
+            return 0;
+        }
+        int low = 0;
+        int high = nums.length - 1;
+        while (low <= high) {
+            int mid = low + ((high - low) >> 1);
+            if (nums[mid] == target) {
+                return mid;
+            }
+            if (nums[mid] < target) {
+                low = mid + 1;
+            } else {
+                high = mid - 1;
+            }
+        }
+        return low;
+    }
+}
+*/