package com.fishercoder.solutions;

/**
 * 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.

 Here are few examples.
 [1,3,5,6], 5 → 2
 [1,3,5,6], 2 → 1
 [1,3,5,6], 7 → 4
 [1,3,5,6], 0 → 0
 */

public class _35 {

    public static class Solution1 {
        public int searchInsert(int[] nums, int target) {
            int len = nums.length;
            for (int i = 0; i < len; i++) {
                if (target <= nums[i]) {
                    return i;
                }
            }
            return len;
        }
    }

}

@@ -33,356 +33,8 @@
 s;%0A%0A
-/**%0A * 35. Search Insert Position%0A *%0A * Given a sorted array and a target value,%0A * return the index if the target is found.%0A * If not, return the index where it would be if it were inserted in order.%0A%0A You may assume no duplicates in the array.%0A%0A Here are few examples.%0A %5B1,3,5,6%5D, 5 %E2%86%92 2%0A %5B1,3,5,6%5D, 2 %E2%86%92 1%0A %5B1,3,5,6%5D, 7 %E2%86%92 4%0A %5B1,3,5,6%5D, 0 %E2%86%92 0%0A */%0A%0A
 publ

refactor 35