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.
Example 1:
Input: [1,3,5,6], 5
Output: 2
Example 2:
Input: [1,3,5,6], 2
Output: 1
Example 3:
Input: [1,3,5,6], 7
Output: 4
Example 4:
Input: [1,3,5,6], 0
Output: 0

class Solution {
    public int searchInsert(int[] nums, int target) {
         //[1,3,5,6], 2
        int prevItemValue = 0;
        int len = nums.length - 1;
     
        if(target == 0) return 0;
        if(target > nums[len]) return len+1;
     
        if(len == 0){ // there is only one item in the array
            if(nums[0] == target){
                return 0;
            }
            return 1;
        }
     
        for(int i=0; i < len;  i++){
            if(i != 0 ) prevItemValue = i-1;
            int itemValue = nums[i];
            if(itemValue == target){
                return i;
            }else if (prevItemValue < target && target < itemValue){
                return i;
            }
        }
     
        return -1;
    }
}

Bu blogdaki popüler yayınlar

About Android padding, margin, width, height, wrap_content, match_parent, R Class