refactor 35

Author: fishercoder1534

README.md

@@ -564,7 +564,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |38|[Count and Say](https://leetcode.com/problems/count-and-say/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_38.java)|O(n*2^n)|O(2^n)|Easy| Recursion, LinkedList
 |37|[Sudoku Solver](https://leetcode.com/problems/sudoku-solver/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_37.java)|O((9!)^9)|O(1)|Hard|
 |36|[Valid Sudoku](https://leetcode.com/problems/valid-sudoku/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_36.java)|O(1)|O(1)|Medium| 
-|35|[Search Insert Position](https://leetcode.com/problems/search-insert-position/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_35.java)|O(n)|O(1)|Medium|Array
+|35|[Search Insert Position](https://leetcode.com/problems/search-insert-position/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_35.java)|O(n)|O(1)|Easy|Array
 |34|[Search for a Range](https://leetcode.com/problems/search-for-a-range/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_34.java)|O(logn)|O(1)|Medium|Array, Binary Search
 |33|[Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_33.java)|O(logn)|O(1)|Medium|Binary Search
 |32|[Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_32.java)|O(n)|O(n)|Hard|Stack, DP

src/main/java/com/fishercoder/solutions/_35.java

@@ -1,7 +1,11 @@
 package com.fishercoder.solutions;
 
 /**
- * Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
+ * 35. Search Insert Position
+ *
+ * Given a sorted array and a target value,
+ * return the index if the target is found.
+ * If not, return the index where it would be if it were inserted in order.
 
  You may assume no duplicates in the array.
 
@@ -11,22 +15,24 @@
  [1,3,5,6], 7 → 4
  [1,3,5,6], 0 → 0
  */
+
 public class _35 {
 
     public int searchInsert(int[] A, int target) {
         int len = A.length;
-        if (len == 0)
+        if (len == 0) {
             return 0;
-        else {
+        } else {
             for (int i = 0; i < len; i++) {
-                if (A[0] > target)
+                if (A[0] > target) {
                     return 0;
-                else if (A[len - 1] < target)
+                } else if (A[len - 1] < target) {
                     return len;
-                else if (A[i] == target)
+                } else if (A[i] == target) {
                     return i;
-                else if (A[i] < target && A[i + 1] > target)
+                } else if (A[i] < target && A[i + 1] > target) {
                     return i + 1;
+                }
             }
             return len;
         }